Alexander L. Gavrilyuk
Orcid: 0000-0001-9296-0313
According to our database1,
Alexander L. Gavrilyuk
authored at least 17 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique.
Des. Codes Cryptogr., May, 2024
Des. Codes Cryptogr., January, 2024
SIAM J. Discret. Math., 2024
2023
Graphs Comb., August, 2023
2021
On few-class Q-polynomial association schemes: feasible parameters and nonexistence results.
Ars Math. Contemp., 2021
2020
2019
Comb., 2019
2018
2016
2014
2012
Distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} do not exist.
Des. Codes Cryptogr., 2012
2010