Strongly regular graphs with the same parameters as the symplectic graph

DOI10.17377/SEMI.2016.13.103MaRDI QIDQ2402163zbMATH OpenFDO

Authors Sho Kubota

Publication date 6 September 2017

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.03442

zbMATH Keywords

cospectral graphsstrongly regular graphswitchingsymplectic graphs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Group actions on combinatorial structures (05E18) Association schemes, strongly regular graphs (05E30)

Abstract: We consider orbit partitions of groups of automorphisms for the symplectic graph and apply Godsil-McKay switching. As a result, we find four families of strongly regular graphs with the same parameters as the symplectic graphs, including the one discovered by Abiad and Haemers. Also, we prove that switched graphs are non-isomorphic to each other by considering the number of common neighbors of three vertices.

Recommendations

• Switched graphs of some strongly regular graphs related to the symplectic graph
• Symplectic graphs modulo pq
• Switched symplectic graphs and their 2-ranks
• Switching for small strongly regular graphs
• Symplectic graphs and their automorphisms

Cited in

(14)

• 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
• New strongly regular graphs from finite geometries via switching
• A switching for all strongly regular collinearity graphs from polar spaces
• Symplectic graphs and their automorphisms
• A new construction of strongly regular graphs with parameters of the complement symplectic graph
• Quantum walks defined by digraphs and generalized Hermitian adjacency matrices
• Switched symplectic graphs and their 2-ranks
• Switching for small strongly regular graphs
• Strongly regular graphs satisfying the 4-vertex condition
• Non-geometric cospectral mates of line graphs with a linear representation
• Quantum isomorphic strongly regular graphs from the E₈ root system
• Switching graphs and Hadamard matrices
• Edge-symmetric strongly regular graphs with at most 100 vertices

This page was built for publication: Strongly regular graphs with the same parameters as the symplectic graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402163)