Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8897780 | Linear Algebra and its Applications | 2018 | 15 Pages |
Abstract
A graph is called a threshold graph if it does not contain induced C4, P4 or 2K2. 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Lu Lu, Qiongxiang Huang, Zhenzhen Lou,