There are only finitely many distance-regular graphs of fixed valency greater than two (Q475256)
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: There are only finitely many distance-regular graphs of fixed valency greater than two |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | There are only finitely many distance-regular graphs of fixed valency greater than two |
scientific article |
Statements
There are only finitely many distance-regular graphs of fixed valency greater than two (English)
0 references
26 November 2014
0 references
distance-regular graphs
0 references
Bannai-Ito conjecture
0 references
sims conjecture
0 references
othogonal polynomials
0 references
Christoffel numbers
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.90414846
0 references
0.8911195
0 references
0.8847301
0 references
0.87855667
0 references
0.8728136
0 references
0.8700302
0 references
0.86959577
0 references
0.86298597
0 references
