A. L. Gavrilyuk, A. A. Makhnev, “Automorphisms of Graphs with Intersection Arrays $\{60,45,8;1,12,50\}$ and $\{49,36,8;1,6,42\}$”, Mat. Zametki, 101:6 (2017), 823–831; Math. Notes, 101:6 (2017), 942–950
A. L. Gavrilyuk, I. V. Khramtsov, A. S. Kondrat'ev, N. V. Maslova, “On realizability of a graph as the prime graph of a finite group”, Sib. Èlektron. Mat. Izv., 11 (2014), 246–257
A. L. Gavrilyuk, A. A. Makhnev, “Distance-regular graph with the intersection array $\{45,30,7;1,2,27\}$ does not exist”, Diskr. Mat., 25:2 (2013), 13–30; Discrete Math. Appl., 23:3-4 (2013), 225–244
A. L. Gavrilyuk, I. Yu. Mogilnykh, “On the Godsil–Higman necessary condition for equitable partitions of association schemes”, Sib. Èlektron. Mat. Izv., 10 (2013), 699–704
5.
A. L. Gavrilyuk, S. V. Goryainov, V. V. Kabanov, “On the vertex connectivity of Deza graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 19:3 (2013), 94–103; Proc. Steklov Inst. Math. (Suppl.), 285, suppl. 1 (2014), S68–S77
A. L. Gavrilyuk, A. A. Makhnev, “On Terwilliger Graphs in Which the Neighborhood of Each Vertex is Isomorphic to the Hoffman–Singleton Graph”, Mat. Zametki, 89:5 (2011), 673–685; Math. Notes, 89:5 (2011), 633–644
A. L. Gavrilyuk, “Investigation of parameters of coding in a point-locomotive communication channel”, Trudy Inst. Mat. i Mekh. UrO RAN, 17:1 (2011), 38–52
2010
8.
A. L. Gavrilyuk, A. A. Makhnev, D. V. Paduchikh, “Distance-regular graphs in which neighborhoods of vertices are isomorphic to the Gewirtz graph”, Trudy Inst. Mat. i Mekh. UrO RAN, 16:2 (2010), 35–47
A. L. Gavrilyuk, “Classification of Ryser Graphs”, Mat. Zametki, 86:1 (2009), 14–21; Math. Notes, 86:1 (2009), 19–25
10.
A. L. Gavrilyuk, “On Terwilliger graphs with $\mu=4$”, Trudy Inst. Mat. i Mekh. UrO RAN, 15:2 (2009), 84–93; Proc. Steklov Inst. Math. (Suppl.), 267, suppl. 1 (2009), S90–S99
2008
11.
A. L. Gavrilyuk, Wenbin Guo, A. A. Makhnev, “Automorphisms of Terwilliger graphs with $\mu=2$”, Algebra Logika, 47:5 (2008), 584–600; Algebra and Logic, 47:5 (2008), 330–339
A. L. Gavrilyuk, A. A. Makhnev, “Об автоморфизмах дистанционно регулярного графа с массивом пересечений $\{60,45,8;1,12,50\}$”, Trudy Inst. Mat. i Mekh. UrO RAN, 13:3 (2007), 41–53
A. L. Gavrilyuk, A. A. Makhnev, “Amply regular graphs and block designs”, Sibirsk. Mat. Zh., 47:4 (2006), 753–768; Siberian Math. J., 47:4 (2006), 621–633
Contact us: