Abstract
A Deza graph with parameters is a k-regular graph with n vertices such that any two of its vertices have b or a common neighbours, where . In this paper we investigate spectra of Deza graphs. In particular, using the eigenvalues of a Deza graph we determine the eigenvalues of its children. Divisible design graphs are significant cases of Deza graphs. Sufficient conditions for Deza graphs to be divisible design graphs are given, a few families of divisible design graphs are presented and their properties are studied. Our special attention goes to the invertibility of the adjacency matrices of Deza graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
