Logo

Download

Title:
A Lower Bound on the Energy of Graphs in Terms of Degree Sequence
Authors:
Saieed Akbari ORCID iD 0000-0001-8994-8858
Akbar Jahanbani ORCID iD 0000-0002-2800-4420
Volume
96
Issue
3
Year
2026
Pages
899-906
Abstract

This paper gives an affirmative answer to a conjecture proposed by Goldberg (2014) relating to graph energy which says that for a graph \( G \) with \( m \) edges, \[ \varepsilon(G) \geq \frac{2m^2}{\displaystyle\sum_{xy \in E(G)} \sqrt{d_x d_y}}. \]