Archimedean graph

In the mathematical field of graph theory, an Archimedean graph is a graph that forms the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, and all of them are regular, polyhedral (and therefore by necessity also 3-vertex-connected planar graphs), and also Hamiltonian graphs.[1]

Along with the 13, the set of infinite prism graphs and antiprism graphs can also be considered Archimedean graphs.[2]

Graph elements
Name Graph Degree Edges Vertices Order
truncated tetrahedral graph3181224
cuboctahedral graph4241248
truncated cubical graph3362448
truncated octahedral graph3362448
rhombicuboctahedral graph4482448
truncated cuboctahedral graph
(great rhombicuboctahedron)
snub cubical graph5602424
icosidodecahedral graph46030120
truncated dodecahedral graph39060120
truncated icosahedral graph39060120
rhombicosidodecahedral graph412060120
truncated icosidodecahedral graph
(great rhombicosidodecahedron)
snub dodecahedral graph51506060

See also


  1. An Atlas of Graphs, p. 267-270
  2. An Atlas of Graphs, p. 261
  • Read, R. C. and Wilson, R. J. An Atlas of Graphs, Oxford, England: Oxford University Press, 2004 reprint, Chapter 6 special graphs pp. 261, 267-269.
  • Weisstein, Eric W. "Archimedean Graph". MathWorld.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.