TY - JOUR
T1 - Energy Ordering of Unicycle graphs
AU - Chen, Ailian
AU - Chang, An
AU - Shiu, Wai Chee
N1 - Funding information:
* The work was supported by the National Natural Science Foundation of China (No.10371019), SDFFZU (No.2003-XQ-22); and Faculty Research Grant, Hong Kong Baptist University
PY - 2006/1
Y1 - 2006/1
N2 - If G is a graph with n vertices and λ1, λ2,...,λn are its eigenvalues, then the energy of G is defined as E(G) = |λ1|+|λ2|+ ⋯ +\λn\. Let G(n) be the set of all unicyclic graphs with n vertices. Y. Hou obtained the minimum value on the energies of the graphs in G(n) and determined the corresponding graph in [10]. In this paper we give the second and third minimum values of the energies of graphs in G(n) and determine their corresponding graphs, respectively.
AB - If G is a graph with n vertices and λ1, λ2,...,λn are its eigenvalues, then the energy of G is defined as E(G) = |λ1|+|λ2|+ ⋯ +\λn\. Let G(n) be the set of all unicyclic graphs with n vertices. Y. Hou obtained the minimum value on the energies of the graphs in G(n) and determined the corresponding graph in [10]. In this paper we give the second and third minimum values of the energies of graphs in G(n) and determine their corresponding graphs, respectively.
UR - https://match.pmf.kg.ac.rs/content55n1.htm
UR - http://www.scopus.com/inward/record.url?scp=33748195774&partnerID=8YFLogxK
M3 - Journal article
AN - SCOPUS:33748195774
SN - 0340-6253
VL - 55
SP - 95
EP - 102
JO - MATCH Communications in Mathematical and in Computer Chemistry
JF - MATCH Communications in Mathematical and in Computer Chemistry
IS - 1
ER -