Switching for small strongly regular graphs

MaRDI QIDQ5869433zbMATH OpenFDO

Authors Ferdinand Ihringer

Publication date 28 September 2022

Full work available at URL https://arxiv.org/abs/2012.08390, http://ajc.maths.uq.edu.au/pdf/84/ajc_v84_p028.pdf

zbMATH Keywords

databasestrongly regular graphswitching

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Abstract: We provide an abundance of strongly regular graphs (SRGs) for certain parameters $(n,k,lambda,mu)$ with $n<100$. For this we use Godsil-McKay (GM) switching with a partition of type $4,n-4$ and Wang-Qiu-Hu (WQH) switching with a partition of type $3,3,n-6$ or $4,4,n-8$. 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 $(81,30,9,12)$ 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

• 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
• 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?)
• 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 chromatic index of strongly regular graphs
• The cycle switching graph of the Steiner triple systems of order 19 is connected
• The Steiner triple systems of order 19

Cited in

(19)

• Partitioning strongly regular graphs
• Switched graphs of some strongly regular graphs related to the symplectic graph
• Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
• 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
• New strongly regular graphs from finite geometries via switching
• Implementing Brouwer's database of strongly regular graphs
• Strongly regular graphs with the same parameters as the symplectic graph
• A switching for all strongly regular collinearity graphs from polar spaces
• Switched symplectic graphs and their 2-ranks
• Construction of strongly regular graphs having an automorphism group of composite order
• On triple systems and strongly regular graphs
• Strongly regular graphs
• Random strongly regular graphs?
• Non-geometric cospectral mates of line graphs with a linear representation
• On the twin-width of near-regular graphs
• On 3-isoregularity of multicirculants
• New example of strongly regular graph with parameters (81, 30, 9, 12) and a simple group A₅ as the automorphism group
• Using a genetic algorithm for construction of strongly regular graphs with a prescribed automorphism group

Describes a project that uses

Uses Software

• nauty
• SageMath
• Traces
• Cliquer

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)