A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph (Q1413223)
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 bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph |
scientific article; zbMATH DE number 2003945
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph |
scientific article; zbMATH DE number 2003945 |
Statements
A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph (English)
0 references
16 November 2003
0 references
0 references
0 references
0.9672083
0 references
0.94183105
0 references
0.9034598
0 references
0.8862664
0 references
0.8814557
0 references
0.87110144
0 references
0.86999136
0 references
0.8686086
0 references
