Abstract
Let \(G\) be a simple graph of order n, without isolated vertices. An important spectrum–based graph invariant is the graph energy. In this paper, we obtain several new upper bounds of the McClelland type on graph energy and characterize graphs for which
these bounds are best possible. The bounds represent generalization and improvement of some known results from the literature.
