Search Results for ""

The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...

The word polyhedron has slightly different meanings in geometry and algebraic geometry. In geometry, a polyhedron is simply a three-dimensional solid which consists of a ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...

The Errera graph is the 17-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The great icosahedron, not to be confused with the great icosidodecahedron orgreat icosicosidodecahedron, is the Kepler-Poinsot polyhedronhose dual is the great stellated ...

The great rhombicuboctahedral graph is the cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron as well as the great ...

The great stellated dodecahedron is one of the Kepler-Poinsot polyhedra. It is also the uniform polyhedron with Maeder index 52 (Maeder 1997), Wenninger index 22 (Wenninger ...

LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...

The small snub icosicosidodecahedral graph is the skeleton of the small retrosnub icosicosidodecahedron and small snub icosicosidodecahedron. It is illustrated above in a ...