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.
Similar content being viewed by others
References
Baer R.: Polarities in finite projective planes. Bull. Am. Math. Soc. 52, 77–93 (1946)
Bose R.C.: Strongly regular graphs, partial geometries and partially balanced designs. Pac. J. Math. 13, 389–419 (1963)
Brouwer A.E., van Lint J.H.: Strongly regular graphs and partial geometries. In: Jackson, D.M., Vanstone, S.A. (eds) Enumeration and Design, pp. 85–122. Academic Press, Toronto (1984)
Cameron P.J.: Strongly regular graphs. In: Beineke, L.W., Wilson, R.J. (eds) Topics in Algebraic Graph Theory, pp. 203–221. Cambridge University Press, Cambridge (2004)
Connor W.S., Clatworthy W.H.: Some theorems for partially balanced designs. Ann. Math. Stat. 25, 100–112 (1954)
Erdős P., Rényi A., Sós V.T.: On a problem of graph theory. Studia Sci. Math. Hungar. 1, 51–57 (1966)
Huneke C.: The friendship theorem. Am. Math. Mon. 109, 192–194 (2002)
Hoffman A.J., Singleton R.R.: On Moore graphs with diameters 2 and 3. IBM J. Res. Dev. 4, 497–504 (1960)
Longyear J.Q., Parsons T.D.: The friendship theorem. Indag. Math. 34, 257–262 (1972)
Wilf H.S.: The friendship theorem. In: Welsh, D.J.A. (ed.) Combinatorial Mathematics and its Applications, pp. 307–309. Academic Press, London (1971)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chvátal, V. Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs. Graphs and Combinatorics 27, 171–175 (2011). https://doi.org/10.1007/s00373-010-0977-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-010-0977-y