Comparison of two techniques for proving nonexistence of strongly regular graphs (Q659689)
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: Comparison of two techniques for proving nonexistence of strongly regular graphs |
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
