Search Results for ""

Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...

The polyhedron compound of the great icosahedron (U_(53)) and the small stellated dodecahedron (U_(34)), sometimes known as the great cid. Four faces meet at each edge of the ...

The great dodecicosahedron is the uniform polyhedron with Maeder index 63 (Maeder 1997), Wenninger index 101 (Wenninger 1989), Coxeter index 79 (Coxeter et al. 1954), and ...

The great dodecicosidodecahedron is the uniform polyhedron with Maeder index 61 (Maeder 1997), Wenninger index 99 (Wenninger 1989), Coxeter index 77(Coxeter et al. 1954), and ...

The great icosihemidodecahedron is the uniform polyhedron with Maeder index 71 (Maeder 1997), Wenninger index 106 (Wenninger 1989), Coxeter index 85 (Coxeter et al. 1954), ...

The great retrosnub icosidodecahedron, also called the great inverted retrosnub icosidodecahedron is the uniform polyhedron with Maeder index 74 (Maeder 1997), Wenninger ...

700 The great triambic icosahedron is the dual of the great ditrigonal icosidodecahedron U_(47) and Wenninger model W_(87) whose appearance is the same as the medial triambic ...

The group direct sum of a sequence {G_n}_(n=0)^infty of groups G_n is the set of all sequences {g_n}_(n=0)^infty, where each g_n is an element of G_n, and g_n is equal to the ...

The gyrobifastigium is an octahedron with on 8 vertices, 14 edges, and 8 faces. The equilateral gyrobifastigium is Johnson solid J_(26), consisting of two triangular prisms ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...