A SHARP UPPER BOUND FOR THE ENERGY OF A CONNECTED GRAPH

Purchase PDF

Published: 2018-11-12

Page: 367-370


RAO LI *

Department of Mathematical Sciences, University of South Carolina Aiken, Aiken, SC 29801, USA

*Author to whom correspondence should be addressed.


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


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://ikprress.org/index.php/AJOMCOR/article/view/4275

Downloads

Download data is not yet available.