Theoretical analysis establishes improved bounds for arithmetic–geometric graph energy using topological indices, characterizing extremal graph structures and cospectral properties.
Let Γ be a graph of order n with m edges, and let Aag(Γ) denote its arithmetic–geometric matrix. The eigenvalues of Aag(Γ) are referred to as the arithmetic–geometric eigenvalues of Γ. The sum of the absolute values of these eigenvalues is called the arithmetic–geometric energy of Γ. In this paper, we establish some new upper and lower bounds for the arithmetic–geometric energy in terms of various topological indices, and we completely characterize the extremal graphs attaining these bounds. We show that our results significantly improve upon several existing bounds reported in the literature. We also provide several ways to construct graphs with the same AM–GM energy but different AM–GM spectra.
No takes yet. Share an insight, caveat, or question.
Ganie et al. (2026) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: