Deza graphs with parameters (v,k,k-2,a)

@article{Kabanov2019DezaGW,
  title={Deza graphs with parameters (v,k,k-2,a)},
  author={V. Kabanov and L. Shalaginov},
  journal={arXiv: Combinatorics},
  year={2019}
}
A Deza graph with parameters $(v,k,b,a)$ is a $k$-regular graph on $v$ vertices in which the number of common neighbors of two distinct vertices takes two values $a$ or $b$ ($a\leq b$) and both cases exist. In the previous papers Deza graphs with parameters $(v,k,b,a)$ where $k-b = 1$ were characterized. In the paper we characterise Deza graphs with $k-b = 2$. 
4 Citations

References

SHOWING 1-10 OF 15 REFERENCES
On strictly Deza graphs with parameters (n, k, k-1, a)
(0, Λ)-graphs and N-cubes
Divisible design graphs
Classification of small (0, 2)-graphs
  • A. Brouwer
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 2006
Classification of the (0, 2)-graphs of valency 8
Shalaginov, Deza graphs with parameters (n, k, k − 1, a) and β = 1
  • J. Combin. Des
  • 2019
On Deza grahps with 14 , 15 and 16 vertices
  • Siberian Electronic Mathematical Reports
  • 2011
Shalaginov, On Deza grahps with 14, 15 and 16 vertices
  • Siberian Electronic Mathematical Reports,
  • 2011
...
1
2
...