Search Results for ""

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

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

A special case of a flag manifold. A Grassmann manifold is a certain collection of vector subspaces of a vector space. In particular, g_(n,k) is the Grassmann manifold of ...

A Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. The term Gray code is often used to refer to a "reflected" code, or more ...

The dual of the uniform great rhombicosidodecahedron U_(67) and Wenninger dual W_(105).

The dual of the uniform great rhombicuboctahedron and Wenninger dual W_(85).

The dual of the great dirhombicosidodecahedron U_(75) and Wenninger dual W_(119).

The dual of the great truncated cuboctahedron U_(20) and Wenninger dual W_(93).

The dual of the great truncated icosidodecahedron U_(68) and Wenninger dual W_(108).

The dual of the great ditrigonal dodecicosidodecahedron U_(42) and Wenninger dual W_(81).