Switching for small strongly regular graphs
From MaRDI portal
Publication:5869433
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.
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
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 1256777 (Why is no real title available?)
- scientific article; zbMATH DE number 1910290 (Why is no real title available?)
- A new partial geometry \(\mathrm{pg}(5,5,2)\)
- Classification algorithms for codes and designs
- Constructing cospectral graphs
- Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- Graph switching, 2-ranks, and graphical Hadamard matrices
- Implementing Brouwer's database of strongly regular graphs
- Isomorphism Testing and Symmetry of Graphs
- Kirkman triple systems with subsystems
- New quasi-symmetric designs by the Kramer-Mesner method
- New regular partial difference sets and strongly regular graphs with parameters \((96,20,4,4)\) and \((96,19,2,4)\)
- New strongly regular graphs from finite geometries via switching
- New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
- On triple systems and strongly regular graphs
- Practical graph isomorphism. II.
- Quantum walks on generalized quadrangles
- Random strongly regular graphs?
- Strongly regular graphs
- Strongly regular graphs
- Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
- Switched symplectic graphs and their 2-ranks
- The Steiner triple systems of order 19
- The chromatic index of strongly regular graphs
- The cycle switching graph of the Steiner triple systems of order 19 is connected
Cited in
(15)- Strongly regular graphs with the same parameters as the symplectic graph
- New strongly regular graphs from finite geometries via switching
- Non-geometric cospectral mates of line graphs with a linear representation
- Strongly regular graphs
- Partitioning strongly regular graphs
- Implementing Brouwer's database of strongly regular graphs
- Construction of strongly regular graphs having an automorphism group of composite order
- On triple systems and strongly regular graphs
- Switched symplectic graphs and their 2-ranks
- A switching for all strongly regular collinearity graphs from polar spaces
- Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
- Random strongly regular graphs?
- Switched graphs of some strongly regular graphs related to the symplectic graph
- Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
- New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
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)
