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 the normal view instead:
scientific article; zbMATH DE number 5999829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison of two techniques for proving nonexistence of strongly regular graphs |
scientific article; zbMATH DE number 5999829 |
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
0.7807642221450806
0 references
0.76279616355896
0 references
0.7530052661895752
0 references
0.751956582069397
0 references
0.7471578121185303
0 references
