English

Deza graphs: a survey and new results

Combinatorics 2021-06-02 v2

Abstract

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 then give an overview of some developments in the area of Deza graphs since the initial paper by five authors [M. Erickson, S. Fernando, W. H. Haemers, D. Hardy, J. Hemmeter, Deza graphs: \emph{A generalization of strongly regular graphs}, J. Comb. Designs. 7 (1999), 395--405.] was written. We then investigate 3-class cyclotomic schemes and give necessary and sufficient conditions to get a Deza graph as a graph given by one relation or the union of two relations. Finally, we prove that a strictly Deza circulant on 2p2p vertices, where pp is prime, is isomorphic to the lexicographical product of the Paley graph on pp vertices with an edge.

Keywords

Cite

@article{arxiv.2103.00228,
  title  = {Deza graphs: a survey and new results},
  author = {Sergey Goryainov and Leonid V. Shalaginov},
  journal= {arXiv preprint arXiv:2103.00228},
  year   = {2021}
}
R2 v1 2026-06-23T23:34:05.408Z