Search Results for ""

The small rhombicosidodecahedral graph is a quartic graph on 60 nodes and 120 edges that corresponds to the skeleton of the small rhombicosidodecahedron, as well as the great ...

The small rhombicuboctahedral graph is a quartic graph on 24 nodes and 48 edges that corresponds to the skeleton of the small rhombicuboctahedron. It has graph diameter 5, ...

The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...

The radius of a polygon's incircle or of a polyhedron's insphere, denoted r or sometimes rho (Johnson 1929). A polygon possessing an incircle is same to be inscriptable or ...

(1-x^2)(d^2y)/(dx^2)-x(dy)/(dx)+alpha^2y=0 (1) for |x|<1. The Chebyshev differential equation has regular singular points at -1, 1, and infty. It can be solved by series ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

A quintic nonhamiltonian graph is a quintic graph that is nonhamiltonian. A number of such graphs are illustrated above. Owens (1980) showed that there exists a ...

An analog of the polyominoes and polyiamonds in which collections of regular hexagons are arranged with adjacent sides. They are also called hexes, hexas, or polyfrobs ...

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