A (49,16,3,6) strongly regular graph does not exist (Q1824629): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3218138 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4749873 / rank | |||
Normal rank | |||
Latest revision as of 10:02, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A (49,16,3,6) strongly regular graph does not exist |
scientific article |
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
