Finite platonic graphs (Q793057)

A Platonic graph G is a finite rectilinear graph in \(E^ 3\) such that: (1) G has the symmetry group of one of the Platonic solids; (2) All vertices of G have the same valence and lie on the rotation axes of G; (3) The subgraph spanned by the vertices of an orbit of cardinality \(>1\) is the 1-skeleton of a Platonic solid. It is shown that there are exactly 16 Platonic graphs: the singleton, and 5 other graphs for the tetrahedral, octahedral, and icosahedral group respectively. Several variants of the above definition are also discussed.