Switched graphs of some strongly regular graphs related to the symplectic graph
Alice M.W. Hui, Bernardo Rodrigues

TL;DR
This paper constructs new infinite families of strongly regular graphs related to symplectic graphs using a switching method, with geometric and coding theory interpretations, expanding the known classes of such graphs.
Contribution
It introduces a novel construction of strongly regular graphs based on symplectic graph geometry and switching techniques, providing explicit parameters and associated binary codes.
Findings
New infinite families of strongly regular graphs with specific parameters
Construction described via geometry of quadrics in projective space
Binary linear codes associated with the graphs have specified parameters
Abstract
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters are constructed for any odd . The construction is described in terms of geometry of quadric in projective space. The binary linear codes of the switched graphs are -code or -code.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
