A (49,16,3,6) strongly regular graph does not exist (Q1824629)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4118396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A (49,16,3,6) strongly regular graph does not exist |
scientific article; zbMATH DE number 4118396 |
Statements
A (49,16,3,6) strongly regular graph does not exist (English)
0 references
1989
0 references
A (49,16,3,6) strongly regular graph has 49 vertices, each vertex has 16 neighbours, any two adjacent vertices have three common neighbours, and any two distinct non-adjacent vertices have six common neighbours. It is proved that such a graph does not exist. The proof uses counting techniques, eigenvalues and a computer.
0 references
strongly regular graph
0 references
counting techniques
0 references
eigenvalues
0 references
computer
0 references
0.8450872898101807
0 references
0.8330661058425903
0 references
