arXiv Analytics

Sign in

arXiv:0906.5389 [math.CO]AbstractReferencesReviewsResources

Comparison of two techniques for proving nonexistence of strongly regular graphs

Vasek Chvatal

Published 2009-06-30Version 1

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.

Journal: Graphs and Combinatorics 27 (2011), 171 - 175
Categories: math.CO
Subjects: 05E30
Related articles: Most relevant | Search more
arXiv:2205.05900 [math.CO] (Published 2022-05-12)
Techniques in equivariant Ehrhart theory
arXiv:2309.12682 [math.CO] (Published 2023-09-22)
The comparison of two Zagreb-Fermat eccentricity indices
arXiv:0712.3895 [math.CO] (Published 2007-12-23)
An Enumeration of Graphical Designs

Links

Toolbox