Abstract
The distance signless Laplacian of a connected graph is defined by , where is the distance matrix of , and is the diagonal matrix whose main entries are the vertex transmissions in . The spectrum of is called the distance signless Laplacian spectrum of . In the present paper, we study some properties of the distance signless Laplacian eigenvalues. Among other results, we show that the complete graph is the unique graph with only two distinct distance signless Laplacian eigenvalues. We prove several bounds on eigenvalues and establish a relationship between being a distance signless Laplacian eigenvalue of and containing a bipartite component.
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.
