# Parameters of Strongly Regular Graphs

Below tables with parameters for strongly regular graphs.
The columns are:

- existence
- v - number of vertices
- k - valency
- λ - number of common neighbours of two adjacent vertices
- μ - number of common neighbours of two nonadjacent vertices
- r
^{f} - positive eigenvalue with multiplicity
- s
^{g} - negative eigenvalue with multiplicity
- comments

The comments are undocumented at present. Ask.

1-50 vertices

51-100 vertices

101-150 vertices

151-200 vertices

201-250 vertices

251-300 vertices

301-350 vertices

351-400 vertices

401-450 vertices

451-500 vertices

501-550 vertices

551-600 vertices

601-650 vertices

651-700 vertices

701-750 vertices

751-800 vertices

801-850 vertices

851-900 vertices

901-950 vertices

951-1000 vertices

1001-1050 vertices

1051-1100 vertices

1101-1150 vertices

1151-1200 vertices

1201-1250 vertices

1251-1300 vertices

many vertices

families

## Elsewhere

For the strongly regular graphs on at most 64 vertices, see the
collection
of Ted Spence.

## Acknowledgement

Thomas Jenrich pointed out that Wallis' construction gives two
parameter sets (on 1216 and 1225 vertices) that had been open.