Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist (Q2633389): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Ivan Nikolaevich Belousov / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Aleksandr Alekseevich Makhnev / rank | |||
Normal rank | |||
Revision as of 06:35, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist |
scientific article |
Statements
Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist (English)
0 references
8 May 2019
0 references
distance-regular graph
0 references
Shilla graph
0 references
triple intersection numbers
0 references
