Comparison of two techniques for proving nonexistence of strongly regular graphs
From MaRDI portal
Abstract: We show that the method of counting closed walks in strongly regular graphs rules out no parameter sets other than those ruled out by the method of counting eigenvalue multiplicities.
Recommendations
- Non-existence of (76,30,8,14) strongly regular graph
- A (49,16,3,6) strongly regular graph does not exist
- There is no strongly regular graph with parameters \((460, 153, 32, 60)\)
- There is no (75,32,10,16) strongly regular graph
- A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
Cites work
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 2149410 (Why is no real title available?)
- scientific article; zbMATH DE number 3358480 (Why is no real title available?)
- scientific article; zbMATH DE number 3384021 (Why is no real title available?)
- On Moore Graphs with Diameters 2 and 3
- Polarities in finite projective planes
- Some Theorems for Partially Balanced Designs
- Strongly regular graphs, partial geometries and partially balanced designs
- The Friendship Theorem
This page was built for publication: Comparison of two techniques for proving nonexistence of strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659689)