Families of parameters for SRNT graphs
Combinatorics
2009-11-13 v1
Abstract
The feasibility conditions obtained in a previous report are refined, and used to determine several infinite families of feasible parameters for strongly regular graphs with no triangles. The methods are also used to improve the lower bound for the number of vertices, and to derive yet another interpretation of the Krein bound.
Keywords
Cite
@article{arxiv.0911.2455,
title = {Families of parameters for SRNT graphs},
author = {Norman Biggs},
journal= {arXiv preprint arXiv:0911.2455},
year = {2009}
}
Comments
11 pages