Platonic graph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Orthographic projections and Schlegel diagrams with Hamiltonian cycles of the vertices of the five platonic solids – only the octahedron has an Eulerian path or cycle, by extending its path with the dotted one
The platonic graphs can be seen as Schlegel diagrams of the platonic solids. (excluding the square pyramid also shown here)

In the mathematical field of graph theory, a Platonic graph is a graph that has one of the Platonic solids as its skeleton. There are 5 Platonic graphs, and all of them are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, edge-transitive and planar graphs), and also Hamiltonian graphs.[1]

Orthogonal projections of platonic solids
3-simplex graph.svg 3-cube t2.svg 3-cube column graph.svg Icosahedron A2 projection.svg Dodecahedral graph.neato.svg

See also[edit]

References[edit]

  1. ^ Read, R. C. and Wilson, R. J. An Atlas of Graphs, Oxford, England: Oxford University Press, 2004 reprint, Chapter 6 special graphs pp. 261, 266.

External links[edit]

  • Weisstein, Eric W. "Platonic graph". MathWorld.