New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs

DOI10.1016/j.disc.2022.113054zbMath1495.05183arXiv2111.10799OpenAlexW3216849808MaRDI QIDQ2166298

Vladislav V. Kabanov

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

strongly regular graphdivisible design graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Designs and configurations (05B99) Graph designs and isomorphic decomposition (05C51)

Related Items (2)

Switching for Small Strongly Regular Graphs ⋮ A new construction of strongly regular graphs with parameters of the complement symplectic graph

Uses Software

• GAP
• GRAPE
• LOOPS

Cites Work

• Unnamed Item
• Unnamed Item
• Spectra of graphs
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Deza graphs based on symplectic spaces
• A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
• New constructions of divisible design Cayley graphs
• Walk-regular divisible design graphs
• Graph switching, 2-ranks, and graphical Hadamard matrices
• Divisible design graphs
• On divisible design Cayley graphs
• Spectra of Deza graphs
• Construction of strongly regular graphs using affine designs
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• Switching for Small Strongly Regular Graphs

This page was built for publication: New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs