1 citations · 1 across the 2 of their papers we have counts for
7 papers
Cliques in Paley graphs of square order and in Peisert graphs
Andries E. Brouwer, Sergey Goryainov, Leonid Shalaginov +1
We study maximal cliques in the collinearity graphs of Desarguesian nets, give some structural results and some numerical information. In particular, we show for Desarguesian nets…
Divisible design graphs with parameters and
Leonid Shalaginov
A -regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into classes of size , such that two distinct vertices from the s…
Deza graphs: a survey and new results
Sergey Goryainov, Leonid V. Shalaginov
In this paper we survey existing results on Deza graphs and give some new results. We present an introduction to Deza graphs for the reader who is unfamiliar with the subject, and…
Generalised dual Seidel switching and Deza graphs with strongly regular children
Vladislav V. Kabanov, Elena V. Konstantinova, Leonid Shalaginov
A Deza graph G with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours, where b >= a. The children G_A and…
Minimum supports of eigenfunctions with the second largest eigenvalue of the Star graph
Vladislav Kabanov, Elena V. Konstantinova, Leonid Shalaginov +1
The Star graph , , is the Cayley graph on the symmetric group generated by the set of transpositions . In this work we study eigenfu…
Deza graphs with parameters and
Sergey Goryainov, Willem H. Haemers, Vladislav V. Kabanov +1
A Deza graph with parameters is a -regular graph with vertices in which any two vertices have or () common neighbours. A Deza graph is strictly…