Smallest regular graphs of given degree and diameter (Q5405283): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5183530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs with excess one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum degree in graphs of diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest Vertex-Transitive Graphs of Given Degree and Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moore graphs and beyond: a survey of the degree/diameter problem / rank
 
Normal rank

Latest revision as of 13:57, 7 July 2024

scientific article; zbMATH DE number 6277518
Language Label Description Also known as
English
Smallest regular graphs of given degree and diameter
scientific article; zbMATH DE number 6277518

    Statements

    Smallest regular graphs of given degree and diameter (English)
    0 references
    2 April 2014
    0 references
    regular graph
    0 references
    degree/diameter problem
    0 references
    extremal graph
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references