Abstract
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). © 2013 Elsevier Inc.
Author supplied keywords
Cite
CITATION STYLE
APA
Bondarenko, A. V., & Radchenko, D. V. (2013). On a family of strongly regular graphs with λ=1. Journal of Combinatorial Theory. Series B, 103(4), 521–531. https://doi.org/10.1016/j.jctb.2013.05.005
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free