Implementing Brouwer's database of strongly regular graphs
arXiv:1601.00181 · doi:10.1007/s10623-016-0264-x
Abstract
Andries Brouwer maintains a public database of existence results for strongly regular graphs on vertices. We implemented most of the infinite families of graphs listed there in the open-source software Sagemath, as well as provided constructions of the "sporadic" cases, to obtain a graph for each set of parameters with known examples. Besides providing a convenient way to verify these existence results from the actual graphs, it also extends the database to higher values of .
18 pages, LaTeX