Archimedean graph

Graph with an Archimedean solid as its skeleton From Wikipedia, the free encyclopedia

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 infinite sets of prism graphs and antiprism graphs can also be considered Archimedean graphs.[2]


See also

References

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.