Abstract
Andries Brouwer maintains a public database of existence results for strongly regular graphs on n≤ 1300 vertices. We have implemented most of the infinite families of graphs listed there in the open-source software Sagemath (The Sage Developers, http://www.sagemath.org), 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 n.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 223-235 |
| Number of pages | 13 |
| Journal | Designs, Codes, and Cryptography |
| Volume | 84 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - Jul 1 2017 |
Funding
The authors thank Andries Brouwer, Eric Chen, Luis Disset, Hadi Kharaghani, Misha Muzychuk, Tim Penttila, John B. Polhill, Leonard Soicher, Vladimir Tonchev, and Alfred Wasserman for many helpful discussions and communications. The second author was partially supported by the EU Horizon 2020 research and innovation programme, Grant Agreement OpenDreamKit No. 676541.
Keywords
- Databases of combinatorial objects
- Explicit computer implementations
- Strongly regular graphs
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Applied Mathematics