Strongly Regular Graphs

  • Andries E. Brouwer
  • Willem H. Haemers
Part of the Universitext book series (UTX)


A graph (simple, undirected, and loopless) of order v is called strongly regular with parameters v, k,λ,μ whenever it is not complete or edgeless.


Regular Graph Linear Code Generalize Quadrangle Petersen Graph Steiner System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Andries E. Brouwer and Willem H. Haemers 2012

Authors and Affiliations

  • Andries E. Brouwer
    • 1
  • Willem H. Haemers
    • 2
  1. 1.Department of MathematicsEindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Department of Econometrics and Operations ResearchTilburg UniversityTilburgThe Netherlands

Personalised recommendations