The degree-diameter problem for circulant graphs of degrees 10 and 11 (Q724874): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Undirected loop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree-diameter problem for circulant graphs of degree 8 and 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree-diameter problem for circulant graphs of degrees 10 and 11 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5150591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a “Square” Functional Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Related to Multimodule Memory Organizations / rank
 
Normal rank

Latest revision as of 05:52, 16 July 2024

scientific article
Language Label Description Also known as
English
The degree-diameter problem for circulant graphs of degrees 10 and 11
scientific article

    Statements

    The degree-diameter problem for circulant graphs of degrees 10 and 11 (English)
    0 references
    0 references
    26 July 2018
    0 references
    0 references
    degree diameter
    0 references
    extremal graph
    0 references
    circulant graph
    0 references
    abelian Cayley graph
    0 references
    0 references
    0 references