Bounding the sum of the largest signless Laplacian eigenvalues of a graph
Aida Abiad, Leonardo de Lima, Sina Kalantarzadeh, Mona Mohammadi,, Carla Oliveira
TL;DR
This paper establishes new sharp bounds for the sum of the largest eigenvalues of the signless Laplacian matrix in graphs, improving upon previous results and extending their applicability.
Contribution
It provides improved and extended bounds for the sum of the largest signless Laplacian eigenvalues in graphs.
Findings
Derived sharp upper bounds for eigenvalue sums
Established sharp lower bounds for eigenvalue sums
Extended previous bounds to broader classes of graphs
Abstract
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and Properties of Aromatic Compounds · Matrix Theory and Algorithms