Switching for small strongly regular graphs
From MaRDI portal
Publication:5869433
zbMATH Open1506.05220arXiv2012.08390MaRDI QIDQ5869433FDOQ5869433
Authors: Ferdinand Ihringer 
Publication date: 28 September 2022
Abstract: We provide an abundance of strongly regular graphs (SRGs) for certain parameters with . For this we use Godsil-McKay (GM) switching with a partition of type and Wang-Qiu-Hu (WQH) switching with a partition of type or . In most cases, we start with a highly symmetric graph which belongs to a finite geometry. Many of the obtained graphs are new; for instance, we find 16565438 strongly regular graphs with parameters while only 15 seem to be described in the literature. We provide statistics about the size of the occurring automorphism groups. We also find the recently discovered Krv{c}adinac partial geometry, thus finding a third method of constructing it.
Full work available at URL: https://arxiv.org/abs/2012.08390
Recommendations
- Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
- New strongly regular graphs from finite geometries via switching
- Strongly regular graphs with the same parameters as the symplectic graph
- Switched graphs of some strongly regular graphs related to the symplectic graph
- A switching for all strongly regular collinearity graphs from polar spaces
Cites Work
- Practical graph isomorphism. II.
- Constructing cospectral graphs
- Quantum walks on generalized quadrangles
- Classification algorithms for codes and designs
- Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
- Title not available (Why is that?)
- Strongly regular graphs
- Switched symplectic graphs and their 2-ranks
- Title not available (Why is that?)
- The cycle switching graph of the Steiner triple systems of order 19 is connected
- Title not available (Why is that?)
- The chromatic index of strongly regular graphs
- On triple systems and strongly regular graphs
- Random strongly regular graphs?
- The Steiner triple systems of order 19
- New quasi-symmetric designs by the Kramer-Mesner method
- Kirkman triple systems with subsystems
- Strongly Regular Graphs
- New regular partial difference sets and strongly regular graphs with parameters \((96,20,4,4)\) and \((96,19,2,4)\)
- Isomorphism Testing and Symmetry of Graphs
- Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
- Graph switching, 2-ranks, and graphical Hadamard matrices
- A new partial geometry \(\mathrm{pg}(5,5,2)\)
- Implementing Brouwer's database of strongly regular graphs
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- New strongly regular graphs from finite geometries via switching
- New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
Cited In (13)
- New strongly regular graphs from finite geometries via switching
- Construction of strongly regular graphs having an automorphism group of composite order
- On triple systems and strongly regular graphs
- Random strongly regular graphs?
- Non-geometric cospectral mates of line graphs with a linear representation
- Switched symplectic graphs and their 2-ranks
- Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
- Switched graphs of some strongly regular graphs related to the symplectic graph
- New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
- Implementing Brouwer's database of strongly regular graphs
- A switching for all strongly regular collinearity graphs from polar spaces
- Strongly regular graphs with the same parameters as the symplectic graph
- Partitioning strongly regular graphs
Uses Software
This page was built for publication: Switching for small strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869433)
