Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique

Authors

Alexander L. Gavrilyuk, Shimane University
Vladislav V. Kabanov, N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences

Abstract

Divisible design graph; Strongly regular graph

Publication Title

Designs Codes and Cryptography

Recommended Citation

Gavrilyuk, A., & Kabanov, V. (2025). Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique. Designs Codes and Cryptography, 93 (6), 2177-2189. https://doi.org/10.1007/s10623-024-01563-y