Divisible design graphs with parameters \((4n,n+2,n-2,2,4,n)\) and \((4n,3n-2,3n-6,2n-2,4,n)\)

DOI10.33048/semi.2021.18.134zbMath1489.05100arXiv2106.08677OpenAlexW4226463621MaRDI QIDQ2145072

Leonid Viktorovich Shalaginov

Publication date: 17 June 2022

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

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

zbMATH Keywords

divisible designDeza graphlattice graphdivisible desing graph

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• Unnamed Item
• The number of perfect matchings in a hypercube
• 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

This page was built for publication: Divisible design graphs with parameters \((4n,n+2,n-2,2,4,n)\) and \((4n,3n-2,3n-6,2n-2,4,n)\)