Notes on the sum of powers of the signless Laplacian eigenvalues of graphs
Lihua You, Jieshan Yang

TL;DR
This paper investigates bounds on the sum of powers of signless Laplacian eigenvalues in graphs, providing sharp bounds for specific graph classes and suggesting directions for future research.
Contribution
It derives sharp bounds for the invariant $S_{\alpha}(G)$ in connected bipartite graphs and graphs with limited connectivity, advancing spectral graph theory understanding.
Findings
Established sharp bounds for $S_{\alpha}(G)$ in bipartite graphs.
Derived bounds for graphs with connectivity up to $k$.
Proposed open problems for further exploration.
Abstract
For a graph and a non-zero real number , the graph invariant is the sum of the power of the non-zero signless Laplacian eigenvalues of . In this paper, we obtain the sharp bounds of for a connected bipartite graph on vertices and a connected graph on vertices having a connectivity less than or equal to , respectively, and propose some open problems for future research.
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 · History and advancements in chemistry
