Journal
LINEAR ALGEBRA AND ITS APPLICATIONS
Volume 682, Issue -, Pages 257-267Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.laa.2023.11.007
Keywords
Signless Laplacian matrix; Characteristic polynomial; Q-eigenvalues
Categories
Ask authors/readers for more resources
This paper presents tight upper bounds for all signless Laplacian eigenvalues of a graph with prescribed order and minimum degree, improving upon previously known bounds. Additionally, the relationship 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 is explored.
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. (c) 2023 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
