Parameters of Strongly Regular Graphs
Below tables with parameters for strongly regular graphs.
The columns are:
- v - number of vertices
- k - valency
- λ - number of common neighbours of two adjacent vertices
- μ - number of common neighbours of two nonadjacent vertices
- rf - positive eigenvalue with multiplicity
- sg - negative eigenvalue with multiplicity
The comments are undocumented at present. Ask.
For the strongly regular graphs on at most 64 vertices, see the
of Ted Spence.
Thomas Jenrich pointed out that Wallis' construction gives two
parameter sets (on 1216 and 1225 vertices) that had been open.