A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The following table lists the Archimedean graphs G, their connectivity d, number of vertices V, number of edges E, order of the automorphism group, Hamiltonicity, Eulerianicity, vertex-transitivity, and edge-transitivity. Note that all Archimedean graphs are Hamiltonian, vertex-transitive.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.