A new construction of strongly regular graphs with parameters of the complement symplectic graph

DOI10.37236/11343OpenAlexW4319722771MaRDI QIDQ2684897

Vladislav V. Kabanov

Publication date: 17 February 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

strongly regular graphdivisible design graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Switched symplectic graphs and their 2-ranks
• Deza graphs based on symplectic spaces
• A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
• Regular graphs with four eigenvalues
• The strongly regular (40, 12, 2, 4) graphs
• New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
• A switching for all strongly regular collinearity graphs from polar spaces
• Divisible design graphs
• Strongly regular graphs with strongly regular decomposition
• Strongly Regular Graphs
• Construction of strongly regular graphs using affine designs

This page was built for publication: A new construction of strongly regular graphs with parameters of the complement symplectic graph