A. L. Gavrilyuk

activity

20102023

most citedEquitable partitions of Latin-square graphs

13 citations · 15 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2023

Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique

Alexander L. Gavrilyuk, Vladislav V. Kabanov

In 2022, the second author found a prolific construction of strongly regular graphs, which is based on joining a coclique and a divisible design graph with certain parameters. The…

math.CO2022★ 2 cited

Equitable 2-partitions of the Johnson graphs $J (n, 3)$

Rhys J. Evans, Alexander L. Gavrilyuk, Sergey Goryainov +1

We finish the classification of equitable 2-partitions of the Johnson graphs of diameter 3, $J (n, 3)$ , for $n > 10$ .

math.CO2018★ 13 cited

Equitable partitions of Latin-square graphs

R. A. Bailey, Peter J. Cameron, Alexander L. Gavrilyuk +1

We study equitable partitions of Latin-square graphs, and give a complete classification of those whose quotient matrix does not have an eigenvalue $- 3$ .

math.CO2010

There exists no distance-regular graph with intersection array {56,36,9;1,3,48}

Alexander L. Gavrilyuk

We prove that a distance-regular graph with intersection array {56,36,9;1,3,48} does not exist. This intersection array is from the table of feasible parameters for distance-regula…