The generalized distance spectrum of a graph and applications

Research output: Contribution to journalArticlepeer-review

Abstract

The generalized distance matrix of a graph is the matrix whose entries depend only on the pairwise distances between vertices, and the generalized distance spectrum is the set of eigenvalues of this matrix. This framework generalizes many of the commonly studied spectra of graphs. We show that for a large class of graphs these eigenvalues can be computed explicitly. We also present the applications of our results to competition models in ecology and rapidly mixing Markov chains.

Original languageEnglish (US)
JournalLinear and Multilinear Algebra
DOIs
StateAccepted/In press - 2020

Keywords

  • Distance-regular graph
  • ecological models
  • Markov chains
  • spectral graph theory

ASJC Scopus subject areas

  • Algebra and Number Theory

Fingerprint Dive into the research topics of 'The generalized distance spectrum of a graph and applications'. Together they form a unique fingerprint.

Cite this