Abstract
By the signless Laplacian of a (simple) graph G we mean the matrix Q ( G ) = D ( G ) + A ( G ) , where A ( G ) , D ( G ) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. For every pair of positive integers n , k , it is proved that if 3 ⩽ k ⩽ n - 3 , then H n , k , the graph obtained from the star K 1 , n - 1 by joining a vertex of degree 1 to k + 1 other vertices of degree 1, is the unique connected graph that maximizes the largest signless Laplacian eigenvalue over all connected graphs with n vertices and n + k edges.
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.
