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

V. V. Kabanov, N. V. Maslova, L. V. Shalaginov

A nonempty $k$-regular graph $\Gamma$ on $n$ vertices is called a Deza graph if there exist constants $b$ and $a$ $(b\ge a)$ such that any pair of distinct vertices of $\Gamma$ has precise…