Exploring new upper and lower bounds for the $A_{\alpha}$-energy of graphs
Mainak Basunia, Pratima Panigrahi

TL;DR
This paper introduces new bounds for the $A_{\alpha}$-energy of graphs, providing sharper estimates and relations to other graph energies, enhancing understanding of spectral graph properties.
Contribution
It presents novel sharp upper and lower bounds for $A_{\alpha}$-energy, compares them with existing results, and explores their connections to other graph energies.
Findings
New sharp bounds for $A_{\alpha}$-energy established.
Improved estimates over previous bounds demonstrated.
Relations between $A_{\alpha}$-energy and other graph energies derived.
Abstract
Let be a graph on vertices and edges. For , the -matrix of is defined as , where is the adjacency matrix and is the degree diagonal matrix of . If are the eigenvalues of , the -energy of is defined as . In this paper, we present novel upper and lower bounds for in terms of standard graph invariants, showing that each bound is sharp and identifying the specific graphs attaining them. For selected bounds, we provide brief comparative analysis with existing results, observing improved estimates. Furthermore, we establish new relations between and other well known graph energies, including adjacency, Laplacian,…
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 · Matrix Theory and Algorithms · Interconnection Networks and Systems
