Search Results for ""

The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).

The dual of the great stellated truncated dodecahedron U_(66) and Wenninger dual W_(104).

The kernel of a group homomorphism f:G-->G^' is the set of all elements of G which are mapped to the identity element of G^'. The kernel is a normal subgroup of G, and always ...

An interval in which one endpoint is included but not the other. A half-closed interval is denoted [a,b) or (a,b] and is also called a half-open interval. The non-standard ...

If intersecting stable and unstable manifolds (separatrices) emanate from fixed points of different families, they are called heteroclinic points.

The hexyl circle is the circumcircle of the hexyl triangle. Amazingly, its center is at the incenter I and its radius is 2R, where R is the circumradius. Its circle function ...

A complex vector bundle is a vector bundle pi:E->M whose fiber bundles pi^(-1)(m) are a copy of C^k. pi is a holomorphic vector bundle if it is a holomorphic map between ...

The central point in a wheel graph W_n. The hub has degree n-1.

A negative-height (inward-pointing) pyramid used in augmentation. The term was introduced by B. Grünbaum.

e^(izcostheta)=sum_(n=-infty)^inftyi^nJ_n(z)e^(intheta), where J_n(z) is a Bessel function of the first kind. The identity can also be written ...