An inequality between intersection numbers of a distance-regular graph (Q1075341)
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: An inequality between intersection numbers of a distance-regular graph |
scientific article; zbMATH DE number 3950579
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An inequality between intersection numbers of a distance-regular graph |
scientific article; zbMATH DE number 3950579 |
Statements
An inequality between intersection numbers of a distance-regular graph (English)
0 references
1987
0 references
It is shown that the number of columns of type (1,1,k-2) in the intersection array of a distance-regular graph with valency k and girth \(>3\) is at most four.
0 references
intersection array
0 references
distance regular graph
0 references
intersection number
0 references
