Search Results for ""

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) ...

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 ...

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...

There are several types of integrals which go under the name of a "Dirichlet integral." The integral D[u]=int_Omega|del u|^2dV (1) appears in Dirichlet's principle. The ...

The problem of finding the connection between a continuous function f on the boundary partialR of a region R with a harmonic function taking on the value f on partialR. In ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

A series which is not convergent. Series may diverge by marching off to infinity or by oscillating. Divergent series have some curious properties. For example, rearranging ...

The divided difference f[x_0,x_1,x_2,...,x_n], sometimes also denoted [x_0,x_1,x_2,...,x_n] (Abramowitz and Stegun 1972), on n+1 points x_0, x_1, ..., x_n of a function f(x) ...