On strictly Deza graphs derived from the Berlekamp-van Lint-Seidel graph

2019/07/05 by Soe Soe Zaw, Zaw, Soe Soe
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1907.02800

arxiv created 2020/02/16 · arxiv updated 2020/02/18

Abstract

In this paper, we find strictly Deza graphs that can be obtained from the Berlekamp-van Lint-Seidel graph by applying dual Seidel switching.

Related

• Deza graphs: a survey and new results
• New constructions of Deza digraphs
• A general construction of strictly Neumaier graphs and a related switching
• Geometrical approach to Seidel's switching for strongly regular graphs
• Hamiltonicity of the Cross-Join Graph of de Bruijn Sequences