Search Results for ""

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

The Kuratowski reduction theorem states that very nonplanar graph contains either the utility graph UG=K_(3,3) or the pentatope graph K_5 as a graph minor. The graphs K_(3,3) ...

An exponential growth law of the form y=ar^x characterizing a quantity which increases at a fixed rate proportionally to itself.

Generalizing from a straight line (i.e., first degree polynomial) to a kth degree polynomial y=a_0+a_1x+...+a_kx^k, (1) the residual is given by ...

The Legendre transform of a sequence {c_k} is the sequence {a_k} with terms given by a_n = sum_(k=0)^(n)(n; k)(n+k; k)c_k (1) = sum_(k=0)^(n)(2k; k)(n+k; n-k)c_k, (2) where ...

The Lemoine ellipse is an inconic (that is always an ellipse) that has inconic parameters x:y:z=(2(b^2+c^2)-a^2)/(bc):(2(a^2+c^2)-b^2)/(ac): (2(a^2+b^2)-c^2)/(ab). (1) The ...

Let mu(sigma) be the least upper bound of the numbers A such that |zeta(sigma+it)|t^(-A) is bounded as t->infty, where zeta(s) is the Riemann zeta function. Then the Lindelöf ...

n vectors X_1, X_2, ..., X_n are linearly dependent iff there exist scalars c_1, c_2, ..., c_n, not all zero, such that sum_(i=1)^nc_iX_i=0. (1) If no such scalars exist, ...

The logarithmic capacity of a compact set E in the complex plane is given by gamma(E)=e^(-V(E)), (1) where V(E)=inf_(nu)int_(E×E)ln1/(|u-v|)dnu(u)dnu(v), (2) and nu runs over ...

The term "loop" has a number of meanings in mathematics. Most simply, a loop is a closed curve whose initial and final points coincide in a fixed point p known as the ...