Search Results for ""

The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...

An edge cut (Holton and Sheehan 1993, p. 14; West 2000, p. 152), edge cut set, edge cutset (Holton and Sheehan 1993, p. 14), or sometimes simply "cut set" or "cutset" (e.g., ...

Let a distribution to be approximated be the distribution F_n of standardized sums Y_n=(sum_(i=1)^(n)(X_i-X^_))/(sqrt(sum_(i=1)^(n)sigma_X^2)). (1) In the Charlier series, ...

Let Delta denote an integral convex polytope of dimension n in a lattice M, and let l_Delta(k) denote the number of lattice points in Delta dilated by a factor of the integer ...

The matrix decomposition of a square matrix A into so-called eigenvalues and eigenvectors is an extremely important one. This decomposition generally goes under the name ...

Einstein summation is a notational convention for simplifying expressions including summations of vectors, matrices, and general tensors. There are essentially three rules of ...

There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...

In physics, the word entropy has important physical implications as the amount of "disorder" of a system. In mathematics, a more abstract definition is used. The (Shannon) ...

Eternity is a puzzle devised by Christopher Monckton and consisting of 209 pieces, each of which is a 12-polydrafter (i.e., a compound of 30-60-90 triangles). The puzzle was ...