Abstract

This paper presents tight upper bounds for all of the signless Laplacian eigenvalues of a graph with prescribed order and minimum degree, which improve previously known upper bounds. Also, the relation between the number of signless Laplacian eigenvalues falling within specific intervals and various graph parameters such as independence, clique, chromatic, edge covering and matching numbers are explored.

Full Text
Published version (Free)

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 call