English

On strictly Deza graphs with parameters (n,k,k-1,a)

Combinatorics 2021-05-11 v3

Abstract

A nonempty kk-regular graph Γ\Gamma on nn vertices is called a Deza graph if there exist constants bb and aa (ba)(b \geq a) such that any pair of distinct vertices of Γ\Gamma has precisely either bb or aa common neighbours. The quantities nn, kk, bb, and aa are called the parameters of Γ\Gamma and are written as the quadruple (n,k,b,a)(n,k,b,a). 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 (n,k,b,a) (n, k, b, a) , where its quantities satisfy the conditions k=b+1k = b + 1 and k(k1)a(n1)ba>1\frac{k(k - 1) - a(n - 1)}{b - a} > 1.

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

R2 v1 2026-06-22T23:30:01.750Z