The lower domination parameters in inflated graphs. - Vladislav V. Kabanov; Igor Vakula (Electron. Notes Discret. Math., 2000)

The lower domination parameters in inflation of graphs of radius 1. - Vladislav V. Kabanov; Igor Vakula (Discret. Math., 2004)

On eigenfunctions and maximal cliques of Paley graphs of square order. - Sergey Goryainov; Vladislav V. Kabanov; Leonid Shalaginov; Alexandr Valyuzhenich (Finite Fields Their Appl., 2018)

On strictly Deza graphs with parameters (n, k, k-1, a). - Vladislav V. Kabanov; N. V. Maslova; Leonid Shalaginov (Eur. J. Comb., 2019)

Minimum Supports of Eigenfunctions with the Second Largest Eigenvalue of the Star Graph. - Vladislav V. Kabanov; Elena V. Konstantinova; Leonid Shalaginov; Alexandr Valyuzhenich (Electron. J. Comb., 2020)

Spectra of strongly Deza graphs. - Saieed Akbari; Willem H. Haemers; Mohammad Ali Hosseinzadeh; Vladislav V. Kabanov; Elena V. Konstantinova; Leonid Shalaginov (Discret. Math., 2021)

Generalised dual Seidel switching and Deza graphs with strongly regular children. - Vladislav V. Kabanov; Elena V. Konstantinova; Leonid Shalaginov (Discret. Math., 2021)

A Note on Moore Cayley Digraphs. - Alexander L. Gavrilyuk; Mitsugu Hirasaka; Vladislav V. Kabanov (Graphs Comb., 2021)

New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs. - Vladislav V. Kabanov (Discret. Math., 2022)

A New Construction of Strongly Regular Graphs with Parameters of the Complement Symplectic Graph. - Vladislav V. Kabanov (Electron. J. Comb., 2023)

Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique. - Alexander L. Gavrilyuk; Vladislav V. Kabanov (Des. Codes Cryptogr., 2024)

Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique. - Alexander L. Gavrilyuk; Vladislav V. Kabanov (Des. Codes Cryptogr., 2025)

Construction of divisible design graphs using affine designs. - Vladislav V. Kabanov (Discret. Math., 2026)