Submitted
Submitted
(with Zinoviev) Completely regular codes in the Johnson graph (Chapter 3 in Completely regular codes in distance-regular graphs, eds. Minjia Shi, Patrick Sole)
(with Cai, Guo, Ponomarenko) Cartesian products of graphs and their coherent configurations. Discrete Mathematics (accepted) arXiv
(with Cai, Guo, Ponomarenko) A large family of strongly regular graphs with small Weisfeiler-Leman dimension. Combinatorica (accepted) arXiv
(with Kabanov) Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique. Designs, Codes and Cryptography (2025) DOI
(with Abiad, Khramova, Ponomarenko) A linear programming bound for sum-rank metric codes. IEEE Transactions on Information Theory (2025) DOI arXiv
(with Koolen) A characterization of the Grassmann graphs. Journal of Combinatorial Theory (B) (2025) DOI arXiv
(with Guo, Ponomarenko) On the Weisfeiler-Leman dimension of permutation graphs. SIAM Journal on Discrete Mathematics (2024) DOI arXiv
(with Kabanov) Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique. Designs, Codes and Cryptography (2024) DOI arXiv
(with Suda) Uniqueness of an association scheme related to the Witt design on 11 points. Designs, Codes and Cryptography (2024) DOI arXiv
(with Nedela, Ponomarenko) The Weisfeiler-Leman dimension of distance-hereditary graphs. Graphs and Combinatorics (2023) DOI arXiv
(with Metsch, Pavese) A modular equality for m-ovoids of elliptic quadrics. Bulletin of the London Mathematical Society (2023) DOI arXiv
(with Suda) On the multiplicities of digraph eigenvalues. Linear Algebra and its Applications (2023) DOI arXiv
On tight sets of hyperbolic quadrics. European Journal of Combinatorics (2023) DOI arXiv
(with Munemasa) Maximal digraphs whose Hermitian spectral radius is at most 2. Linear Algebra and its Applications (2023) DOI arXiv
(with Munemasa, Sano, Taniguchi) Signed analogue of line graphs and their smallest eigenvalues. Journal of Graph Theory (2021) DOI arXiv
(with Hirasaka and Kabanov) A note on Moore Cayley digraphs. Graphs and Combinatorics (2021) DOI
(with Vidali and Williford) On few-class Q-polynomial association schemes: feasible parameters and nonexistence results. Ars Mathematica Contemporanea (2021) DOI arXiv
(with Suda and Vidali) On tight 4-design in Hamming association schemes. Combinatorica (2020) DOI arXiv
(with Bailey, Cameron, Goryainov) Equitable partitions of Latin-square graph. Journal of Combinatorial Designs (2019) DOI arXiv
(with Bang, Koolen) Distance-regular graphs without 4-claws. European Journal of Combinatorics (2019) DOI arXiv
(with Matkin) Cameron-Liebler line classes in PG(3,5). Journal of Combinatorial Designs (2018) DOI arXiv
(with Koolen) A characterization of the graphs of bilinear (d x d)-forms over F_2. Combinatorica (2018) DOI arXiv
(with Matkin, Penttila) Derivation of Cameron-Liebler line classes. Designs, Codes and Cryptography (2017) DOI arXiv
(with Cheng, Greaves, Koolen) Biregular graphs with three eigenvalues. European Journal of Combinatorics (2016) DOI arXiv
(with Koolen) The Terwilliger polynomial of a Q-polynomial distance-regular graph and its application to pseudo-partition graphs. Linear Algebra and its Applications (2015) DOI arXiv
(with Metsch) A modular equality for Cameron-Liebler line classes. Journal of Combinatorial Theory (A) (2014) DOI
(with Mogilnykh) Cameron-Liebler line classes in PG(n,4). Designs, Codes and Cryptography (2014) DOI arXiv
(with Goryainov, Kabanov) On the vertex connectivity of Deza graphs. Proceedings of the Steklov Institute of Mathematics (Supplementary issues) (2014) DOI
(with Mogilnykh) On the Godsil-Higman necessary condition for equitable partitions of association schemes. Siberian Electronic Math Reports (2014) pdf
(with Makhnev) There exist no distance-regular graphs with intersection array {45, 30, 7; 1, 2, 27}. Discrete Mathematics and Applications (2013) DOI pdf
(with Goryainov) On perfect 2-colorings of Johnson graphs J(v,3). Journal of Combinatorial Designs (2014) DOI pdf
(with Makhnev) Distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} do not exist. Designs, Codes and Cryptography (2012) DOI
(with Makhnev) On Terwilliger graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph. Mathematical Notes (2011) DOI
Distance-regular graphs with intersection arrays {56, 36, 9; 1, 3, 48} and {55, 36, 11; 1, 4, 45} do not exist. Doklady Mathematics (2011) DOI
On the Koolen-Park inequality and Terwilliger graphs. Electronic Journal of Combinatorics (2010) pdf
(with Makhnev) On automorphisms of distance-regular graphs with intersection array {56, 45, 1; 1, 9, 56}. Doklady Mathematics (2010) DOI
The classification of Ryser graphs. Mathematical Notes (2009) DOI
(with Makhnev) Terwilliger graphs in which the neighborhood of some vertex is isomorphic to the Petersen graph. Doklady Mathematics (2008) DOI
(with Guo, Makhnev) Automorphisms of Terwilliger graphs with μ=2. Algebra and Logic (2008) DOI
(with Makhnev) Terwilliger graphs with μ≤ 3. Mathematical Notes (2007) DOI
(with Makhnev) On the regularity problem in Terwilliger graphs. Doklady Mathematics (2007) DOI
(with Makhnev) Amply regular graphs and block designs. Siberian Mathematical Journal (2006) DOI
(with Makhnev) On Krein graphs without triangles. Doklady Mathematics (2005) pdf