English

On a family of strongly regular graphs with \lambda=1

Combinatorics 2012-02-06 v3 Metric Geometry

Abstract

In this paper, we give a complete description of strongly regular graphs with parameters ((n^2+3n-1)^2,n^2(n+3),1,n(n+1)). All possible such graphs are: the lattice graph L3,3L_{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).

Keywords

Cite

@article{arxiv.1201.0383,
  title  = {On a family of strongly regular graphs with \lambda=1},
  author = {Andriy V. Bondarenko and Danylo V. Radchenko},
  journal= {arXiv preprint arXiv:1201.0383},
  year   = {2012}
}

Comments

17 pages

R2 v1 2026-06-21T19:59:03.928Z