A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph (Q1911238)
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: A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph |
scientific article; zbMATH DE number 867724
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph |
scientific article; zbMATH DE number 867724 |
Statements
A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph (English)
0 references
23 September 1996
0 references
For any distance-regular graph with valency \(k \geq 3\) the author shows that the number of columns \((1, k-2, 1)\) in its intersection array is at most 20 by using the intersection diagrams of the graph.
0 references
distance-regular graph
0 references
intersection array
0 references
intersection diagrams
0 references
