Abstract

Let G be a connected graph with order n and D(G) be its distance matrix. Suppose that λ1(D)≥⋯≥λn(D) are the distance eigenvalues of G. In this paper, we give an upper bound on the least distance eigenvalue and characterize all the connected graphs with −1−2≤λn(D)≤a where a is the smallest root of x3−x2−11x−7=0 and a∈(−1−2,−2). Furthermore, we show that connected graphs with λn(D)≥−1−2 are determined by their distance spectra. As applications, we give some lower bounds on the distance spread of graphs with given some parameters. In the end, we characterize connected graphs with the (k+1)th smallest distance spread.

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 call

Disclaimer: 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.