Classification of regular planar graphs with diameter two
A classification of regular planar graphs of diameter two is given. More precisely, it is proved that if \(G\) is a \(k\)-regular planar graph of diameter two, then \(2\leq k\leq 4\) and (i) if \(k=2\), then \(G\) is isomorphic either to the cycle of length 4 or to the cycle of length 5 (proof trivial); (ii) if \(k=3\), then \(G\) is isomorphic to the Cartesian product \(K_2\times K_3\); (iii) if \(k=4\), then \(G\) is isomorphic to one of the three graphs given in the paper (the first is the octahedron, of order 6; the second is the Shrikhande graph, of order 8; and the third is a graph of order 9).
- Domination numbers of planar graphs
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3708283 (Why is no real title available?)
- scientific article; zbMATH DE number 874567 (Why is no real title available?)
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
- Almost self-centered graphs
- On second order degree of graphs
- scientific article; zbMATH DE number 4055652 (Why is no real title available?)
- scientific article; zbMATH DE number 1546840 (Why is no real title available?)
- scientific article; zbMATH DE number 7597458 (Why is no real title available?)
- New improvements on connectivity of cages
- Nordhaus-Gaddum type results for connected domination number of graphs
This page was built for publication: Classification of regular planar graphs with diameter two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884912)