Spectra of strongly Deza graphs

Akbari, S ; Sharif University of Technology | 2021

192 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.disc.2021.112622
  3. Publisher: Elsevier B.V , 2021
  4. Abstract:
  5. A Deza graph G with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours. The children GA and GB of a Deza graph G are defined on the vertex set of G such that every two distinct vertices are adjacent in GA or GB if and only if they have a or b common neighbours, respectively. A strongly Deza graph is a Deza graph with strongly regular children. In this paper we give a spectral characterisation of strongly Deza graphs, show relationships between eigenvalues, and study strongly Deza graphs which are distance-regular. © 2021 Elsevier B.V
  6. Keywords:
  7. Deza graph ; Cospectral graphs ; Distance-regular graph ; Divisible design graph ; Strongly regular graph ; Eigenvalues
  8. Source: Discrete Mathematics ; Volume 344, Issue 12 , 2021 ; 0012365X (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0012365X21003356