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:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique.
Des. Codes Cryptogr., May, 2024

Uniqueness of an association scheme related to the Witt design on 11 points.
Des. Codes Cryptogr., January, 2024

On the Weisfeiler-Leman Dimension of Permutation Graphs.
SIAM J. Discret. Math., 2024

2023
The Weisfeiler-Leman Dimension of Distance-Hereditary Graphs.
Graphs Comb., August, 2023

On tight sets of hyperbolic quadrics.
Eur. J. Comb., June, 2023

2021
Signed analogue of line graphs and their smallest eigenvalues.
J. Graph Theory, 2021

A Note on Moore Cayley Digraphs.
Graphs Comb., 2021

On few-class Q-polynomial association schemes: feasible parameters and nonexistence results.
Ars Math. Contemp., 2021

2020
On Tight 4-Designs in Hamming Association Schemes.
Comb., 2020

2019
Distance-regular graphs without 4-claws.
Eur. J. Comb., 2019

A Characterization of the Graphs of Bilinear (d×d)-Forms over F<sub>2</sub>.
Comb., 2019

2018
Derivation of Cameron-Liebler line classes.
Des. Codes Cryptogr., 2018

2016
Biregular graphs with three eigenvalues.
Eur. J. Comb., 2016

2014
A modular equality for Cameron-Liebler line classes.
J. Comb. Theory A, 2014

Cameron-Liebler line classes in PG(n, 4).
Des. Codes Cryptogr., 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
On the Koolen-Park inequality and Terwilliger graphs.
Electron. J. Comb., 2010


  Loading...