Abstract A graph is called a threshold graph if it does not contain induced C 4 , P 4 or 2 K 2 . Such graphs have numerous applications in… Click to show full abstract
Abstract A graph is called a threshold graph if it does not contain induced C 4 , P 4 or 2 K 2 . Such graphs have numerous applications in computer science and psychology, and they also have nice spectral properties. In this paper, we consider the distance matrix of a connected threshold graph. We show that there are no distance eigenvalues of threshold graphs lying in the interval ( − 2 , − 1 ) and all the eigenvalues, other than −2 or −1, are simple. Besides, we determine all threshold graphs with distinct distance eigenvalues.
Keywords:
threshold graphs;
distance spectra;
distance;
graph;
spectra threshold
Journal Title: Linear Algebra and its Applications
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Linear Algebra and its Applications
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!