Search Results for ""

The pentakis icosidodecahedral graph, illustrated above, is a graph on 42 vertices that is the skeleton of the pentakis icosidodecahedron.

The rhombicosahedral graph, illustrated above, is the skeleton of the icosidodecadodecahedron, rhombicosahedron and rhombidodecadodecahedron. It will be implemented in a ...

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

The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...

The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...

The truncated pentakis dodecahedral graph, illustrated above in a pair of embeddings, is the skeleton of the truncated pentakis dodecahedron. It has 180 vertices, 270 edges, ...

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...

A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...

A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...

An interval is a connected portion of the real line. If the endpoints a and b are finite and are included, the interval is called closed and is denoted [a,b]. If the ...