Article ID Journal Published Year Pages File Type
421146 Discrete Applied Mathematics 2014 10 Pages PDF
Abstract

The chemical energy of an nn-vertex graph GG is defined as CE(G)={2∑i=1n2λi(G)if  n  is even ,2∑i=1n−12λi(G)+λn+12(G)if  n  is odd . Here λ1(G),λ2(G),…,λn(G)λ1(G),λ2(G),…,λn(G) are the eigenvalues of GG arranged in non-increasing order. We give lower and upper bounds for the chemical energy of graphs, and determine the extremal unicyclic graphs with minimal and maximal chemical energies.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,