Skip to main content
Article thumbnail
Location of Repository

Families of parameters for SRNT graphs

By Norman Biggs


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

Topics: QA Mathematics
Publisher: arXiv
Year: 2009
OAI identifier:
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.