A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist (Q686983): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1817580 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Dmitry G. Fon-Der-Flaass / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992965 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\) / rank | |||
Normal rank | |||
Latest revision as of 10:13, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist |
scientific article |
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
