Switching for Small Strongly Regular Graphs
From MaRDI portal
Publication:5869433
zbMath1506.05220arXiv2012.08390MaRDI QIDQ5869433
Publication date: 28 September 2022
Full work available at URL: https://arxiv.org/abs/2012.08390
Related Items (2)
New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs ⋮ Non-geometric cospectral mates of line graphs with a linear representation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Switched symplectic graphs and their 2-ranks
- On triple systems and strongly regular graphs
- Constructing cospectral graphs
- The cycle switching graph of the Steiner triple systems of order 19 is connected
- New quasi-symmetric designs by the Kramer-Mesner method
- Kirkman triple systems with subsystems
- Classification algorithms for codes and designs
- New regular partial difference sets and strongly regular graphs with parameters \((96,20,4,4)\) and \((96,19,2,4)\)
- Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
- Strongly regular graphs
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
- A new partial geometry \(\mathrm{pg}(5,5,2)\)
- New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
- New strongly regular graphs from finite geometries via switching
- Graph switching, 2-ranks, and graphical Hadamard matrices
- Implementing Brouwer's database of strongly regular graphs
- Quantum walks on generalized quadrangles
- Practical graph isomorphism. II.
- The chromatic index of strongly regular graphs
- Isomorphism Testing and Symmetry of Graphs
- The Steiner triple systems of order 19
- Strongly Regular Graphs
- Random strongly regular graphs?
This page was built for publication: Switching for Small Strongly Regular Graphs
