On two conjectures on sum of the powers of signless Laplacian eigenvalues of a graph
F. Ashraf

TL;DR
This paper disprove two conjectures regarding the extremal values of the sum of powers of signless Laplacian eigenvalues in bipartite graphs and graphs with bounded connectivity.
Contribution
It provides counterexamples to two conjectures about the extremal properties of signless Laplacian eigenvalues in specific graph classes.
Findings
Disproved conjectures on extremal eigenvalue sums.
Identified specific graph classes where conjectures do not hold.
Enhanced understanding of spectral properties of signless Laplacian matrices.
Abstract
Let be a simple graph and be the signless Laplacian matrix of . Let be the sum of the -th powers of the nonzero eigenvalues of . We disprove two conjectures by You and Yang on the extremal values of among bipartite graphs and among graphs with bounded connectivity.
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 · Metal-Organic Frameworks: Synthesis and Applications
