A SHARP UPPER BOUND FOR THE ENERGY OF A CONNECTED GRAPH

Main Article Content

RAO LI

Abstract

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

Article Details

How to Cite
LI, R. (2018). A SHARP UPPER BOUND FOR THE ENERGY OF A CONNECTED GRAPH. Asian Journal of Mathematics and Computer Research, 25(6), 367-370. Retrieved from https://www.ikprress.org/index.php/AJOMCOR/article/view/4275
Section
Short Research Article