The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results (Q2364627): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GAP / rank | |||
Normal rank | |||
Revision as of 12:06, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results |
scientific article |
Statements
The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results (English)
0 references
21 July 2017
0 references
distance-regular graph
0 references
strongly regular graph
0 references
antipodal cover
0 references
fundamental group
0 references
