Switched graphs of some strongly regular graphs related to the symplectic graph

DOI10.1007/S10623-017-0340-XMaRDI QIDQ1692159zbMATH OpenOpenAlexFDO

Authors Alice M. W. Hui, B. G. Rodrigues

Publication date 26 January 2018

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

cospectral graphlinear code of a graphstrongly regular graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Polar geometry, symplectic spaces, orthogonal spaces (51A50) Combinatorial codes (94B25)

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 $(2^{n}pm{2}^{(n-1)/2},2^{n-1}pm{2}^{(n-1)/2},2^{n-2}pm{2}^{(n-3)/2},2^{n-2}pm{2}^{(n-1)/2})$ are constructed for any odd $ngeq5$. The construction is described in terms of geometry of quadric in projective space. The binary linear codes of the switched graphs are $[2^{n}mp{2}^{fracn-12},n+3,2^{t+1}{]}_2$-code or $[2^{n}mp{2}^{fracn-12},n+3,2^{t+2}{]}_2$-code.

Review text

The authors use the Godsil-McKay switching to construct new classes of strongly regular graphs cospectral with strongly regular graphs obtained from (elliptic or hyperbolic) non-singular quadrics in projective space \(\mathrm{PG}(n,2)\) for odd \(n\geq 5\), which have parameters \((2^n \pm 2^{\frac{n-1}2}, 2^{n-1}\pm 2^{\frac{n-1}2}, 2^{n-2}\pm 2^{\frac{n-3}2}, 2^{n-2}\pm 2^{\frac{n-1}2})\). The paper further gives the number of the non-isomorphic switched graphs found in this way, and determines the parameters of the binary linear codes associated with these switched graphs.

Recommendations

• Strongly regular graphs with the same parameters as the symplectic graph
• Switched symplectic graphs and their 2-ranks
• New strongly regular graphs from finite geometries via switching
• Switching for small strongly regular graphs
• A switching for all strongly regular collinearity graphs from polar spaces

Cites work

• A switching for all strongly regular collinearity graphs from polar spaces
• Binary codes of strongly regular graphs
• Constructing cospectral graphs
• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• scientific article; zbMATH DE number 53569 (Why is no real title available?)
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• Locally cotriangular graphs
• New families of strongly regular graphs
• Spectra of graphs
• Strongly regular graphs with the same parameters as the symplectic graph
• Switched symplectic graphs and their 2-ranks
• Uniqueness of strongly regular graphs having minimal p-rank

Cited in

(11)

• Strongly regular graphs from classical generalized quadrangles
• The Hermitian two-graph and its code
• New strongly regular graphs from finite geometries via switching
• Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
• Godsil-McKay switching and twisted Grassmann graphs
• Strongly regular graphs with the same parameters as the symplectic graph
• A switching for all strongly regular collinearity graphs from polar spaces
• A new construction of strongly regular graphs with parameters of the complement symplectic graph
• Switched symplectic graphs and their 2-ranks
• Switching for small strongly regular graphs
• Non-geometric cospectral mates of line graphs with a linear representation

This page was built for publication: Switched graphs of some strongly regular graphs related to the symplectic graph

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