Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\) (Q1907109)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\) |
scientific article; zbMATH DE number 839133
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\) |
scientific article; zbMATH DE number 839133 |
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
0.94132286
0 references
0.9355743
0 references
0.9337877
0 references
0.9206501
0 references
0.92036724
0 references
0.9183279
0 references
0.91576177
0 references
0.9149204
0 references
0.9141783
0 references
0 references
