Implementing Brouwer's database of strongly regular graphs
From MaRDI portal
Publication:2364640
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 .
Recommendations
Cites work
- A 64-dimensional counterexample to Borsuk's conjecture
- A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs
- A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
- A new strongly regular graph
- A skew Hadamard matrix of order 36
- A skew-Hadamard matrix of order 92
- Classification of some strongly regular subgraphs of the McLaughlin graph
- Combinatorics of symmetric designs
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- Constructing two-weight codes with prescribed groups of automorphisms
- Examples of computer experimentation in algebraic combinatorics
- Existence of Five MOLS of Orders 18 and 60
- Finite generalized quadrangles
- Four Mutually Orthogonal Latin Squares of Order 14
- HEMISYSTEMS ON THE HERMITIAN SURFACE
- scientific article; zbMATH DE number 4014743 (Why is no real title available?)
- scientific article; zbMATH DE number 1817540 (Why is no real title available?)
- scientific article; zbMATH DE number 3745240 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 166092 (Why is no real title available?)
- scientific article; zbMATH DE number 1273665 (Why is no real title available?)
- scientific article; zbMATH DE number 2149412 (Why is no real title available?)
- Negative Latin square type partial difference sets and amorphic association schemes with Galois rings
- New families of strongly regular graphs
- On a class of strongly regular designs and quasi-semisymmetric designs
- On Borsuk's conjecture for two-distance sets
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Polarities of G. Higman's symmetric design and a strongly regular graph on 176 vertices
- Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\)
- Some classes of Hadamard matrices with constant diagonal
- Some new results on optimal codes over \(\mathbb F_5\)
- Spectra of graphs
- Spreads in strongly regular graphs
- Strongly regular graphs
- Strongly Regular Graphs Derived from Combinatorial Designs
- Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
- Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
- Symmetric Bush-type Hadamard matrices of order 4m^4 exist for all odd m
- Symmetric Conference Matrices of Order pq 2 + 1
- The CRC handbook of combinatorial designs
- The existence of a Bush-type Hadamard matrix of order 324 and two new infinite classes of symmetric designs
- The regular two-graph on 276 vertices
- The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
- Tournaments and Hadamard matrices
- Uniqueness and nonexistence of some graphs related to \(M_{22}\)
Cited in
(8)- Wheeler graphs: a framework for BWT-based data structures
- House of Graphs: a database of interesting graphs
- House of graphs 2.0: a database of interesting graphs and more
- On some distance-regular graphs with many vertices
- DiscreteZOO: a fingerprint database of discrete objects
- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}
- A new family of partial difference sets in 3-groups
- Switching for small strongly regular graphs
This page was built for publication: Implementing Brouwer's database of strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364640)
