On the Koolen-Park inequality and Terwilliger graphs. - Alexander L. Gavrilyuk (Electron. J. Comb., 2010)

Distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} do not exist. - Alexander L. Gavrilyuk; Alexander A. Makhnev (Des. Codes Cryptogr., 2012)

Cameron-Liebler line classes in PG(n, 4). - Alexander L. Gavrilyuk; Ivan Yu. Mogilnykh (Des. Codes Cryptogr., 2014)

A modular equality for Cameron-Liebler line classes. - Alexander L. Gavrilyuk; Klaus Metsch (J. Comb. Theory A, 2014)

Biregular graphs with three eigenvalues. - Xi-Ming Cheng; Alexander L. Gavrilyuk; Gary R. W. Greaves; Jack H. Koolen (Eur. J. Comb., 2016)

Derivation of Cameron-Liebler line classes. - Alexander L. Gavrilyuk; Ilia Matkin; Tim Penttila (Des. Codes Cryptogr., 2018)

A Characterization of the Graphs of Bilinear (d×d)-Forms over F2. - Alexander L. Gavrilyuk; Jack H. Koolen (Comb., 2019)

Distance-regular graphs without 4-claws. - Sejeong Bang; Alexander L. Gavrilyuk; Jack H. Koolen (Eur. J. Comb., 2019)

On Tight 4-Designs in Hamming Association Schemes. - Alexander L. Gavrilyuk; Sho Suda; Janos Vidali (Comb., 2020)

On few-class Q-polynomial association schemes: feasible parameters and nonexistence results. - Alexander L. Gavrilyuk; Janos Vidali; Jason S. Williford (Ars Math. Contemp., 2021)

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

Signed analogue of line graphs and their smallest eigenvalues. - Alexander L. Gavrilyuk; Akihiro Munemasa; Yoshio Sano; Tetsuji Taniguchi (J. Graph Theory, 2021)

On tight sets of hyperbolic quadrics. - Alexander L. Gavrilyuk (Eur. J. Comb., 2023)

The Weisfeiler-Leman Dimension of Distance-Hereditary Graphs. - Alexander L. Gavrilyuk; Roman Nedela; Ilia Ponomarenko (Graphs Comb., 2023)

On the Weisfeiler-Leman Dimension of Permutation Graphs. - Jin Guo; Alexander L. Gavrilyuk; Ilia Ponomarenko (SIAM J. Discret. Math., 2024)

Uniqueness of an association scheme related to the Witt design on 11 points. - Alexander L. Gavrilyuk; Sho Suda (Des. Codes Cryptogr., 2024)

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

Cartesian products of graphs and their coherent configurations. - Jinzhuan Cai; Jin Guo; Alexander L. Gavrilyuk; Ilia Ponomarenko (Discret. Math., 2025)

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

A characterization of the Grassmann graphs. - Alexander L. Gavrilyuk; Jack H. Koolen (J. Comb. Theory B, 2025)

A Linear Programming Bound for Sum-Rank Metric Codes. - Aida Abiad; Alexander L. Gavrilyuk; Antonina P. Khramova; Ilia Ponomarenko (IEEE Trans. Inf. Theory, 2025)

A Large Family of Strongly Regular Graphs with Small Weisfeiler-Leman Dimension. - Jinzhuan Cai; Jin Guo; Alexander L. Gavrilyuk; Ilia Ponomarenko (Comb., 2025)

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