Bounding the diameter of distance. Regular graphs (Q1110534): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/combinatorica/Godsil88, #quickstatements; #temporary_batch_1731462974821 |
||
| (One intermediate revision by one other user not shown) | |||
| 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
