Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 95-102 |
| Number of pages | 8 |
| Journal | MATCH Communications in Mathematical and in Computer Chemistry |
| Volume | 55 |
| Issue number | 1 |
| Publication status | Published - Jan 2006 |
Fingerprint
Dive into the research topics of 'Energy Ordering of Unicycle graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver