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)

The Smallest Strictly Neumaier Graph and its Generalisations. - Rhys J. Evans; Sergey Goryainov; Dmitry Panasenko (Electron. J. Comb., 2019)

On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs. - Sergey Goryainov; Dmitry Panasenko (Eur. J. Comb., 2019)

On the (signless Laplacian) spectral radius of minimally k-(edge)-connected graphs for small k. - Dandan Fan; Sergey Goryainov; Huiqiu Lin (Discret. Appl. Math., 2021)

The EKR-Module Property of Pseudo-Paley Graphs of Square Order. - Shamil Asgarli; Sergey Goryainov; Huiqiu Lin; Chi Hoi Yip (Electron. J. Comb., 2022)

On a correspondence between maximal cliques in Paley graphs of square order. - Sergey Goryainov; Alexander Masley; Leonid Shalaginov (Discret. Math., 2022)

On eigenfunctions and maximal cliques of generalised Paley graphs of square order. - Sergey Goryainov; Leonid Shalaginov; Chi Hoi Yip (Finite Fields Their Appl., 2023)

A general construction of strictly Neumaier graphs and a related switching. - Rhys J. Evans; Sergey Goryainov; Elena V. Konstantinova; Alexander D. Mednykh (Discret. Math., 2023)

Extremal Peisert-type graphs without the strict-EKR property. - Sergey Goryainov; Chi Hoi Yip (J. Comb. Theory, Ser. A, 2024)

Non-canonical maximum cliques without a design structure in the block graphs of 2-designs. - Sergey Goryainov; Elena V. Konstantinova (Des. Codes Cryptogr., 2024)

Equitable 2-partitions of the Johnson graphs J(n,3). - Rhys J. Evans; Alexander L. Gavrilyuk; Sergey Goryainov; Konstantin Vorob'ev (Discret. Math., 2025)

Divisible design graphs from the symplectic graph. - Bart De Bruyn; Sergey Goryainov; Willem H. Haemers; Leonid Shalaginov (Des. Codes Cryptogr., 2025)