Strongly Regular Graphs
Part of the Universitext book series (UTX)
- 3.5k Downloads
A graph (simple, undirected, and loopless) of order v is called strongly regular with parameters v, k,λ,μ whenever it is not complete or edgeless.
KeywordsRegular 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.
© Andries E. Brouwer and Willem H. Haemers 2012