On a family of strongly regular graphs with λ=1

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

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial theory. Series B 2013-07, Vol.103 (4), p.521-531
Main Authors: Bondarenko, Andriy V., Radchenko, Danylo V.
Format: Article
Language:English
Subjects:
Automorphism group
Brouwer–Haemers graph
Games graph
Strongly regular graph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we give a complete description of strongly regular graphs with parameters ((n2+3n−1)2,n2(n+3),1,n(n+1)). All possible such graphs are: the lattice graph L3,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).
ISSN:0095-8956
1096-0902
DOI:10.1016/j.jctb.2013.05.005