On strictly Deza graphs with parameters (n,k,k-1,a)
Combinatorics
2021-05-11 v3
Abstract
A nonempty -regular graph on vertices is called a Deza graph if there exist constants and such that any pair of distinct vertices of has precisely either or common neighbours. The quantities , , , and are called the parameters of and are written as the quadruple . If a Deza graph has diameter 2 and is not strongly regular, then it is called a strictly Deza graph. In the paper we investigate strictly Deza graphs with parameters , where its quantities satisfy the conditions and .
Keywords
Cite
@article{arxiv.1712.09529,
title = {On strictly Deza graphs with parameters (n,k,k-1,a)},
author = {V. V. Kabanov and N. V. Maslova and L. V. Shalaginov},
journal= {arXiv preprint arXiv:1712.09529},
year = {2021}
}
Comments
Any comments or suggestions are very welcome