Skip to main content

Extremal Graphs of Chemical Trees with Minimal Atom-Bond Connectivity Index

  • Conference paper
  • First Online:
Fuzzy Information and Engineering and Decision (IWDS 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 646))

Included in the following conference series:

  • 872 Accesses

Abstract

The atom-bond connectivity (ABC) index is a degree-based molecular structure descriptor that found chemical applications. A chemical tree is a tree whose maximum degree is no greater than 4. The lower bound of ABC index for chemical trees has been obtained by Furtula et al. [Discrete Applied Mathematics, 157(2009)2828-2835]. In this paper, we sharpened the lower bound of atom-bond connectivity index of chemical trees of some particular cases. In addition, a way to obtain extremal graphs is obtained, which shows the complexity of the structure of extremal graphs.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Todeschini, R., Consonni, V.: Handbook of Molecular Descriptors. Wiley-VCH, Weinheim (2000)

    Book  Google Scholar 

  2. Furtula, B., Traovac, A., Vukičević, D.: Atom-bond connectivity index of trees. Discr. Appl. Math. 157, 2828–2835 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gutman, I., Furtula, B., Ivanović, M.: Notes on trees with minimal atom-bondconnectivity index. MATCH Commun. Math Comput. Chem. 67, 467–482 (2012)

    MathSciNet  MATH  Google Scholar 

  4. Lin, W., Lin, X., Tao, T., Wu, X.: Proving a conjecture of gutman concerning trees with minimal ABC index. MATCH Commun. Math. Comput. Chem. 69, 549–557 (2013)

    MathSciNet  MATH  Google Scholar 

  5. XinT, R., Zhoua, B.: Extremal trees with fixed degree sequence for atom-bond connectivity index. Filomat 26(4), 683–688 (2012)

    Article  MathSciNet  Google Scholar 

  6. Tan, L., Liu, B., Yu, Z.: The ABC index of trees with given degree sequence. Commun. Math. Comput. Chem. 68, 137–145 (2012)

    MathSciNet  Google Scholar 

Download references

Acknowledgements

Thanks to the support by National Undergraduate Project Funding for Innovation and Entrepreneurship in 2015, Code201510564282.

Recommender: Muhuo Liu, South China Agricultural University, Associate Professor.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fu-yi Wei .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Wei, Fy., Xie, Zy., Qu-Wei, Zhang, Gb., Ye, Wp., Zhu, Yl. (2018). Extremal Graphs of Chemical Trees with Minimal Atom-Bond Connectivity Index. In: Cao, BY. (eds) Fuzzy Information and Engineering and Decision. IWDS 2016. Advances in Intelligent Systems and Computing, vol 646. Springer, Cham. https://doi.org/10.1007/978-3-319-66514-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66514-6_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66513-9

  • Online ISBN: 978-3-319-66514-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics