This article is cited in 2 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.

UDC: 519.177

MSC: 05E30; 05B20; 05C50; 05E18

Received September 30, 2016, published December 23, 2016

Language: English

DOI: 10.17377/semi.2016.13.103

Bibliographic databases:

•