Abstract
For a simple graph on n vertices, any of its signless Laplacian eigenvalues is in the interval [0,2n−2]. In this paper, we give relationships between the number of signless Laplacian eigenvalues in specific intervals in [0,2n−2] and graph invariants including matching number and diameter.
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.
