On a family of strongly regular graphs with λ=1

2012/01/01 by Andriy Bondarenko, Danylo Radchenko, Bondarenko, Andriy V. +1
Computer Science · Engineering · Mathematics · #05C25 #05C50 #11D61 #41A55 #52C99 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Metric Geometry (math.MG) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1201.0383

openalex publication_date 2012/01/01 · openalex created_date 2024/04/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we give a complete description of strongly regular graphs with parameters ((n²+3n-1)²,n²(n+3),1,n(n+1)). All possible such graphs are: the lattice graph L_3,3 with parameters (9,4,1,2), the Brouwer-Haemers graph with parameters (81,20,1,6), and the Games graph with parameters (729,112,1,20).

Related

• There is no strongly regular graph with parameters (460,153,32,60)
• There does not exist a strongly regular graph with parameters (1911,270,105,27)
• Strongly regular graphs with parameters (85,14,3,2) do not exist
• The Subgraphs of Order Six of the Family of Strongly Regular Graphs with Parameters λ=1 and μ=2
• A large family of strongly regular graphs with small Weisfeiler-Leman dimension