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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Created claim: DBLP publication ID (P1635): journals/combinatorica/Godsil88, #quickstatements; #temporary_batch_1731462974821
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Chris D. Godsil / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Ralph G.Stanton / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56673209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spherical codes and designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvectors of Distance-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue multiplicities of highly symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new feasibility condition for distance-regular graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02189090 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094707013 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/combinatorica/Godsil88 / rank
 
Normal rank

Latest revision as of 03:06, 13 November 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