Search Results for ""

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

Find the figure bounded by a line which has the maximum area for a given perimeter. The solution is a semicircle. The problem is based on a passage from Virgil's Aeneid: "The ...

A differential-algebraic equation (DAE) is a type of differential equation in which the derivatives are not (in general) expressed explicitly, and typically derivatives of ...

Differential evolution is a stochastic parallel direct search evolution strategy optimization method that is fairly fast and reasonably robust. Differential evolution is ...

Differential geometry is the study of Riemannian manifolds. Differential geometry deals with metrical notions on manifolds, while differential topology deals with nonmetrical ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

Let f be a real-valued function defined on an interval [a,b] and let x_0 in (a,b). The four one-sided limits D^+f(x_0)=lim sup_(x->x_0+)(f(x)-f(x_0))/(x-x_0), (1) ...

The 2-1 equation A^n+B^n=C^n (1) is a special case of Fermat's last theorem and so has no solutions for n>=3. Lander et al. (1967) give a table showing the smallest n for ...

A dipyramid, also called a bipyramid, consists of two pyramids symmetrically placed base-to-base. The dipyramids are duals of the regular prisms. Their skeletons are the ...

The quantum electrodynamical law which applies to spin-1/2 particles and is the relativistic generalization of the Schrödinger equation. In 3+1 dimensions (three space ...