A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist (Q686983)
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 distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist |
scientific article; zbMATH DE number 429052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist |
scientific article; zbMATH DE number 429052 |
Statements
A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist (English)
0 references
13 October 1993
0 references
The theorem stated in the title is proved. Concerning distance-regular graphs see \textit{A. E. Brouwer}, \textit{A. M. Cohen} and \textit{A. Neumaier} [Distance-regular graphs (1989; Zbl 0747.05073)].
0 references
intersection array
0 references
distance-regular graphs
0 references
0.98131907
0 references
0.9552697
0 references
0.95135045
0 references
0.9505198
0 references
0.94964033
0 references
0 references
0.9408952
0 references
0.93895966
0 references
