Abstract
The distance Laplacian matrix of a connected graph G is defined in [2,3] and it is proved that for a graph G on n vertices, if the complement of G is connected, then the second smallest distance Laplacian eigenvalue is strictly greater than n. In this article, we consider the graphs whose complement is a tree or a unicyclic graph, and characterize the graphs among them having n+1 as the second smallest distance Laplacian eigenvalue. We prove that the largest distance Laplacian eigenvalue of a path is simple and the corresponding eigenvector has the similar property like that of a Fiedler vector.
Sign-in/Register to access full text options 
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.
