Classification of regular planar graphs with diameter two (Q884912): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3899969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination numbers of planar graphs / rank
 
Normal rank

Revision as of 19:51, 25 June 2024

scientific article
Language Label Description Also known as
English
Classification of regular planar graphs with diameter two
scientific article

    Statements

    Classification of regular planar graphs with diameter two (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 June 2007
    0 references
    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).
    0 references
    graph
    0 references
    regular
    0 references
    diameter
    0 references
    planar
    0 references
    outer planar
    0 references

    Identifiers