A SHARP UPPER BOUND FOR THE ENERGY OF A CONNECTED GRAPH
RAO LI *
Department of Mathematical Sciences, University of South Carolina Aiken, Aiken, SC 29801, USA
*Author to whom correspondence should be addressed.
The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the graph. A new upper bound for the energy of a connected graph is presented in this note. The upper bound involves the chromatic number and the rank of the graph.
Keywords: Energy, chromatic number, rank