Finite platonic graphs
From MaRDI portal
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.
Recommendations
- Finite planes and graphs
- A note on nearly platonic graphs
- The spectrum of Platonic graphs over finite fields
- Graphs embedded into finite projective planes
- scientific article; zbMATH DE number 4154462
- scientific article; zbMATH DE number 1099607
- scientific article; zbMATH DE number 2149409
- Minimum Integral Drawings of the Platonic Graphs
- scientific article; zbMATH DE number 890666
Cites work
Cited in
(11)- Cheeger constants of Platonic graphs.
- Symmetry-type graphs of Platonic and Archimedean solids
- Characterizing the platonic solids and Petersen graph as k-levels locally homogeneous graphs
- scientific article; zbMATH DE number 1214995 (Why is no real title available?)
- Zigzag and central circuit structure of \((\{1,2,3\}, 6)\)-spheres
- A note on nearly Platonic graphs with connectivity one
- On families of 2-nearly Platonic graphs
- scientific article; zbMATH DE number 3894064 (Why is no real title available?)
- Balanced 3-nearly Platonic graphs
- A note on nearly platonic graphs
- The spectrum of Platonic graphs over finite fields
This page was built for publication: Finite platonic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793057)