|
This article is cited in 2 scientific papers (total in 3 papers)
Mathematical logic, algebra and number theory
Strongly regular graphs with the same parameters as the symplectic graph
S. Kubota Graduate School of Information Sciences, Tohoku University, Sendai, Japan
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.
Keywords:
cospectral graphs; switching; strongly regular graph; symplectic graphs.
Received September 30, 2016, published December 23, 2016
Citation:
S. Kubota, “Strongly regular graphs with the same parameters as the symplectic graph”, Sib. Èlektron. Mat. Izv., 13 (2016), 1314–1338
Linking options:
https://www.mathnet.ru/eng/semr753 https://www.mathnet.ru/eng/semr/v13/p1314
|
|