8 citations · 20 across the 5 of their papers we have counts for
6 papers · 1 filter
A general construction of strictly Neumaier graphs and a related switching
Rhys J. Evans, Sergey Goryainov, Elena V. Konstantinova +1
We present a construction of Neumaier graphs with nexus 1, which generalises two known constructions of Neumaier graphs. We also use W. Wang, L. Qiu, and Y. Hu switching to show th…
On balanced characteristic functions of canonical cliques in Paley graphs of square order
Sergey Goryainov, Huiqiu Lin
In this paper we prove that balanced characteristic functions of canonical cliques in a Paley graph of square order span the -eigenspace of the graph. This…
The spanning -trees, perfect matchings and spectral radius of graphs
Dandan Fan, Sergey Goryainov, Xueyi Huang +1
A -tree is a spanning tree in which every vertex has degree at most . In this paper, we provide a sufficient condition for the existence of a -tree in a connected graph wi…
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…
Enumeration of strictly Deza graphs with at most 21 vertices
Sergey Goryainov, Dmitry Panasenko, Leonid Shalaginov
A Deza graph with parameters is a -regular graph with vertices such that any two distinct vertices have or common neighbours, where . A Deza…
On a correspondence between maximal cliques in Paley graphs of square order
Sergey Goryainov, Alexander Masley, Leonid Shalaginov
Let be an odd prime power. Denote by the value of modulo 4. In this paper, we establish a linear fractional correspondence between two types of maximal cliques of si…