Search Results for ""

A theorem which effectively describes how lengths, areas, volumes, and generalized n-dimensional volumes (contents) are distorted by differentiable functions. In particular, ...

A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...

A complete set of mutually conjugate group elements. Each element in a group belongs to exactly one class, and the identity element (I=1) is always in its own class. The ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

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

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

The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...

The great dirhombicosidodecahedron is the uniform polyhedron with Maeder index 75 (Maeder 1997), Wenninger index 119 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), ...

A hexagon tiling is a tiling of the plane by identical hexagons. The regular hexagon forms a regular tessellation, also called a hexagonal grid, illustrated above. There are ...