A SHARP UPPER BOUND FOR THE ENERGY OF A CONNECTED GRAPH |Asian Journal of Mathematics and Computer

The sum of the absolute values of the graph's eigenvalues is the energy of the graph. This note presents a new upper bound for the energy of a connected graph. The chromatic number and the graph's rank form the upper bound.

Please see the link :- https://www.ikprress.org/index.php/AJOMCOR/article/view/4275