The diameter of bipartite distance-regular graphs (Q1165256): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Trivalent Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Permutation Groups and Finite Simple Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tetravalent Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Transitive Graphs of Valency Four / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bipartite tetra0alent graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the diameter of a distance-transitive graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonexistence of 8-transitive graphs / rank
 
Normal rank

Latest revision as of 14:58, 13 June 2024

scientific article
Language Label Description Also known as
English
The diameter of bipartite distance-regular graphs
scientific article

    Statements

    The diameter of bipartite distance-regular graphs (English)
    0 references
    1982
    0 references
    distance-regular
    0 references
    intersection arrays
    0 references
    diameter
    0 references
    girth
    0 references
    degree
    0 references

    Identifiers