Comparison of two techniques for proving nonexistence of strongly regular graphs (Q659689): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:52, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of two techniques for proving nonexistence of strongly regular graphs |
scientific article |
Statements
Comparison of two techniques for proving nonexistence of strongly regular graphs (English)
0 references
24 January 2012
0 references
Strongly regular graphs
0 references
Friendship theorem
0 references
counting closed walks
0 references
counting eigenvalue multiplicities
0 references
