Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\) (Q1907109): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1996.0004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031429956 / rank | |||
Normal rank | |||
Latest revision as of 00:30, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\) |
scientific article |
Statements
Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\) (English)
0 references
29 January 1996
0 references
We show that, if a bipartite distance-regular graph of valency \(k\) has an eigenvalue of multiplicity \(k\), then it becomes 2-homogeneous. Combined with a result on bipartite 2-homogeneous distance-regular graphs by K. Nomura, we have a classification of such graphs.
0 references
bipartite distance-regular graph
0 references
eigenvalue
0 references
2-homogeneous distance- regular graphs
0 references
