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 . 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.
|Number of pages||8|
|Journal||MATCH Communications in Mathematical and in Computer Chemistry|
|Publication status||Published - 2006|
Scopus Subject Areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics