Enumeration of strictly Deza graphs with at most 21 vertices

DOI10.33048/semi.2021.18.107zbMath1475.05178arXiv2102.10624OpenAlexW3130991148MaRDI QIDQ2058354

Leonid Viktorovich Shalaginov, Dmitriy Igorevich Panasenko, Sergey Viktorovich Goryainov

Publication date: 8 December 2021

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

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

zbMATH Keywords

strongly regular graphDeza graphstrictly Deza graphdual Seidel switching

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs

Cites Work

• Deza graphs on 14, 15 and 16 vertices
• Cayley-Deza graphs with fewer than 60 vertices
• Generalised dual Seidel switching and Deza graphs with strongly regular children
• Walk-regular divisible design graphs
• Divisible design graphs
• Deza graphs: A generalization of strongly regular graph
• Deza graphs with parameters and