Bounding the diameter of distance. Regular graphs (Q1110534): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q56673209, #quickstatements; #temporary_batch_1710289860281
Property / Wikidata QID
 
Property / Wikidata QID: Q56673209 / rank
 
Normal rank

Revision as of 01:36, 13 March 2024

scientific article
Language Label Description Also known as
English
Bounding the diameter of distance. Regular graphs
scientific article

    Statements

    Bounding the diameter of distance. Regular graphs (English)
    0 references
    1988
    0 references
    Let G be a connected distance regular graph with valence \(k>2\) and diameter d. Suppose further that G is not a complete multipartite graph. let \(\theta\) be an eigenvalue of G with \(\theta \neq Ik,\) and \(m>1\). Then there are only finitely many connected, co-connected distance regular graphs with an eigenvalue of multiplicity m.
    0 references
    connected graphs
    0 references
    co-connected graphs
    0 references
    distance regular graph
    0 references
    eigenvalue
    0 references
    0 references

    Identifiers

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