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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
