Abstract
The signless Laplacian spread of G is defined as SQ ( G ) = μ 1 ( G ) - μ n ( G ) , where μ 1 ( G ) and μ n ( G ) are the maximum and minimum eigenvalues of the signless Laplacian matrix of G , respectively. This paper presents some upper and lower bounds for SQ ( G ) . Moreover, the unique unicyclic graph with maximum signless Laplacian spread among the class of connected unicyclic graphs of order n is determined.
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.
