Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist (Q438891)
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 \52, 35, 16; 1, 4, 28\ and \69, 48, 24; 1, 4, 46\ do not exist |
scientific article; zbMATH DE number 6062570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist |
scientific article; zbMATH DE number 6062570 |
Statements
Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist (English)
0 references
31 July 2012
0 references
distance-regular graph
0 references
intersection array
0 references
Terwilliger graph
0 references
0 references
0.8984214663505554
0 references
0.8978436589241028
0 references
0.8874267935752869
0 references
0.885248064994812
0 references
0.8850697875022888
0 references
