Energy ordering of unicycle graphs

Ailian Chen*, An Chang, Wai Chee SHIU

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

39 Citations (Scopus)

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 languageEnglish
Pages (from-to)95-102
Number of pages8
JournalMatch
Volume55
Issue number1
Publication statusPublished - 2006

Scopus Subject Areas

  • Chemistry(all)
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Energy ordering of unicycle graphs'. Together they form a unique fingerprint.

Cite this