Comparison of two techniques for proving nonexistence of strongly regular graphs
classification
🧮 math.CO
keywords
countinggraphsmethodregularstronglyclosedcomparisoneigenvalue
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.