Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique

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

05C50; 05E30; 51E05; Divisible design graph; Strongly regular graph; Symmetric design

Publication Title

Designs Codes and Cryptography

Recommended Citation

Gavrilyuk, A., & Kabanov, V. (2024). Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique. Designs Codes and Cryptography, 92 (5), 1379-1391. https://doi.org/10.1007/s10623-023-01348-9