Comparison of two techniques for proving nonexistence of strongly regular graphs

DOI10.1007/S00373-010-0977-YzbMath1233.05219arXiv0906.5389OpenAlexW1985852682MaRDI QIDQ659689

Vašek Chvátal

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.5389

zbMATH Keywords

Strongly regular graphscounting closed walkscounting eigenvalue multiplicitiesFriendship theorem

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (1)

Switchings, extensions, and reductions in central digraphs

Cites Work

• Strongly regular graphs, partial geometries and partially balanced designs
• On Moore Graphs with Diameters 2 and 3
• The Friendship Theorem
• Some Theorems for Partially Balanced Designs
• Polarities in finite projective planes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparison of two techniques for proving nonexistence of strongly regular graphs