Construction of divisible design graphs using affine designs

DOI10.1016/J.DISC.2025.114717MaRDI QIDQ6884431zbMATH OpenFDO

Authors Vladislav Kabanov

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114717

zbMATH Keywords

divisible design graph

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51) Association schemes, strongly regular graphs (05E30)

Cites work

• A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs
• Classification of divisible design graphs with at most 39 vertices
• Combinatorial Properties of Group Divisible Incomplete Block Designs
• Construction of strongly regular graphs using affine designs
• Divisible design graphs
• Divisible design graphs with parameters (4n,n+2,n-2,2,4,n) and (4n,3n-2,3n-6,2n-2,4,n)
• scientific article; zbMATH DE number 1817540 (Why is no real title available?)
• New constructions of divisible design Cayley graphs
• New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
• On divisible design Cayley graphs
• Spectra of graphs
• Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique
• The CRC handbook of combinatorial designs
• Walk-regular divisible design graphs

Cited in

(3)

• Divisible design graphs from symplectic graphs over rings with a unique non-trivial ideal
• Divisible design graphs with selfloops
• Divisible design graphs obtained by plugging a difference set into a construction for antipodal distance-regular graphs of diameter 3

This page was built for publication: Construction of divisible design graphs using affine designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884431)