Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist (Q2633389)
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: Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist |
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
0 references
0 references
0.9864434
0 references
0.97688204
0 references
0.96931386
0 references
0.9662176
0 references
0.9538867
0 references
0.9538343
0 references
0.9536174
0 references
0.9492662
0 references
