On the Distance Spectra of Graphs

G. Aalipour, Aida Abiad Monge, Z. Berikkyzy, J. Cummings, J. De Silva, W. Gao, K. Heysse, L. Hogben*, F.H.J. Kenter, J.C.-H. Lin, M. Tait

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. The distance eigenvalues of G are the eigenvalues of its distance matrix and they form the distance spectrum of G. We determine the distance spectra of double odd graphs and Doob graphs, completing the determination of distance spectra of distance regular graphs having exactly one positive distance eigenvalue. We characterize strongly regular graphs having more positive than negative distance eigenvalues. We give examples of graphs with few distinct distance eigenvalues but lacking regularity properties. We also determine the determinant and inertia of the distance matrices of lollipop and barbell graphs. 

Original languageEnglish
Pages (from-to)66-87
Number of pages22
JournalLinear Algebra and Its Applications
Publication statusPublished - 15 May 2016


  • Distance matrix
  • Eigenvalue
  • Distance regular graph
  • Kneser graph
  • Double odd graph
  • Doob graph
  • Lollipop graph
  • Barbell graph
  • Distance spectrum
  • Strongly regular graph
  • Optimistic graph
  • Determinant
  • Inertia
  • Graph


Dive into the research topics of 'On the Distance Spectra of Graphs'. Together they form a unique fingerprint.

Cite this