Book contents
- Frontmatter
- Contents
- Preface
- 1 Graphs
- 2 Polar spaces
- 3 Graphs related to polar spaces
- 4 Buildings
- 5 Fischer spaces
- 6 Golay codes,Witt designs, and Leech lattice
- 7 Cyclotomic constructions
- 8 Combinatorial constructions
- 9 p-Ranks
- 10 Individual graph descriptions
- 11 Classification of rank 3 graphs
- 12 Parameter table
- References
- Parameter Index
- Author Index
- Subject Index
12 - Parameter table
Published online by Cambridge University Press: 06 January 2022
- Frontmatter
- Contents
- Preface
- 1 Graphs
- 2 Polar spaces
- 3 Graphs related to polar spaces
- 4 Buildings
- 5 Fischer spaces
- 6 Golay codes,Witt designs, and Leech lattice
- 7 Cyclotomic constructions
- 8 Combinatorial constructions
- 9 p-Ranks
- 10 Individual graph descriptions
- 11 Classification of rank 3 graphs
- 12 Parameter table
- References
- Parameter Index
- Author Index
- Subject Index
Summary
In this chapter we give a table with the feasible parameter sets of arbitrary strongly regular graphs on at most 512 vertices, and add comments about the known examples. These include: existence (and number of nonisomorphic examples), the parameters, the spectrum, information about being a descendant of a regular two-graph or being in the switching class of a regular two-graph, possible relation with a projective two-weight code,possible relation with a partial geometry, whether it is a conference graph or transversal design. Miscellaneous comments include references to earlier parts of the book, name of the graph, reason for non-existence, possible relation with a Steiner system, etc.
Keywords
- Type
- Chapter
- Information
- Strongly Regular Graphs , pp. 399 - 424Publisher: Cambridge University PressPrint publication year: 2022