Skip to main content

Note on the Minimal Energy Ordering of Conjugated Trees

  • Conference paper
Intelligent Computing Technology (ICIC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7389))

Included in the following conference series:

  • 2544 Accesses

Abstract

For a simple graph G, the energy E(G) is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix A(G). Gutman proposed two conjectures on the minimal energy of the class of conjugated trees (trees having a perfect matching). Zhang and Li determined the trees in the class with the minimal and second-minimal energies, which confirms the conjectures. Zhang and Li also found that the conjugated tree with the third-minimal energy is one of the two graphs which are quasi-order incomparable. Recently, Huo, Li and Shi found there exists a fixed positive integer N 0, such that for all n > N 0, the energy of the graphs with the third-minimal through the sixth-minimal are determined. In this paper, the N 0 is fixed by a recursive method, and the problem is solved completely.

Supported by NSFC and Youth Innovation foundation of Qinghai Normal University.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)

    Book  MATH  Google Scholar 

  2. Coulson, C.A.: On the Calculation of the Energy in Unsaturated Hydrocarbon Molecules. Proc. Cambridge Phil. Soc. 36, 201–203 (1940)

    Article  Google Scholar 

  3. Cvetković, D.M., Doob, M., Sachs, H.: Spectra of Graphs-Theory and Application. Academic Press, New York (1980)

    Google Scholar 

  4. Chen, A., Chang, A., Shiu, W.C.: Energy Ordering of Unicyclic Graphs. MATCH Commun. Math. Comput. Chem. 55, 95–102 (2006)

    MathSciNet  MATH  Google Scholar 

  5. Gutman, I.: Acylclic Systems with Extremal Hückel π-electron energy. Theor. Chim. Acta 45, 79–87 (1977)

    Article  Google Scholar 

  6. Gutman, I., Polansky, O.E.: Mathematical Concepts in Organic Chemistry. Springer, Berlin (1986)

    Book  MATH  Google Scholar 

  7. Gutman, I., Zhang, F.: On the Ordering of Graphs with Respect to Their Matching Numbers. Discrete Appl. Math. 15, 25–33 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gutman, I.: Acylclic Conjugated Molecules, Trees and Their Energies. J. Math. Chem. 1, 123–143 (1987)

    MathSciNet  Google Scholar 

  9. Gutman, I.: The Energy of a Graph: Old and New Results. In: Betten, A., Kohnert, A., Laue, R., Wassermann, A. (eds.) Algebraic Combinatorics and Applications, pp. 196–211. Springer, Berlin (2001)

    Google Scholar 

  10. Gutman, I., Li, X., Zhang, J.: Graph Energy. In: Dehmer, M., Emmert-Streib, F. (eds.) Analysis of Complex Networks: From Biology to Linguistics, pp. 145–174. Wiley-VCH Verlag, Weinheim (2009)

    Google Scholar 

  11. Hou, Y.: Unicyclic Graphs with Minimal Energy. J. Math. Chem. 29, 163–168 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hou, Y.: On Trees with the Least Energy and a Given Size of Matching. J. Syst. Sci. Math. Sci. 23, 491–494 (2003)

    MATH  Google Scholar 

  13. Huo, B., Li, X., Shi, Y., Wang, L.: Determining the Conjugated Trees with the Third-through the Sixth-minimal Energies. MATCH Commun. Math. Comput. Chem. 65, 521–532 (2011)

    MathSciNet  Google Scholar 

  14. Lin, W., Guo, X., Li, H.: On the Extremal Energies of Trees with a Given Maximum Degree. MATCH Commun. Math. Comput. Chem. 54, 363–378 (2005)

    MathSciNet  MATH  Google Scholar 

  15. Li, S., Li, N.: On Minimal Energies of Acyclic Conjugated Molecules. MATCH Commun. Math. Comput. Chem 61, 341–349 (2009)

    MathSciNet  Google Scholar 

  16. Li, X., Zhang, J., Wang, L.: On Bipartite Graphs with Minimal Energy. Discrete Appl. Math. 157, 869–873 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Zhang, F., Li, H.: On acyclic Conjugated Molecules with Minimal Energies. Discrete Appl. Math. 92, 71–84 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  18. Zhang, F., Lai, Z.: Three Theorems of Comparison of Trees by Their Energy. Science Exploration 3, 12–19 (1983)

    MathSciNet  Google Scholar 

  19. Zhou, B., Li, F.: On Minimal Energies of Trees of a Prescribed Diameter. J. Math. Chem. 39, 465–473 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiao, Y., Huo, B. (2012). Note on the Minimal Energy Ordering of Conjugated Trees. In: Huang, DS., Jiang, C., Bevilacqua, V., Figueroa, J.C. (eds) Intelligent Computing Technology. ICIC 2012. Lecture Notes in Computer Science, vol 7389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31588-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31588-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31587-9

  • Online ISBN: 978-3-642-31588-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics