Minimum Augmented Zagreb Index on Chemical Trees with Given Number of Pendent Vertices
Abstract: Given a graph , the augmented Zagreb index is defined to be where and are vertices of , denotes the degree of the vertex . In this paper, we consider chemical trees with a given number of pendent vertices and derive sharp lower bounds for the index among this class of trees. We also characterize the extremal chemical trees with a fixed number of pendent vertices. Keywords: Chemical trees, Augmented Zagreb index, Topological indices, Extremal graphs. Title: Minimum Augmented Zagreb Index on Chemical Trees with Given Number of Pendent Vertices Author: Fuqin Zhan International Journal of Mathematics and Physical Sciences Research ISSN 2348-5736 (Online) Vol. 13, Issue 2, October 2025 - March 2026 Page No: 53-64 Research Publish Journals Website: www.researchpublish.com Published Date: 06-December-2025 DOI: https://doi.org/10.5281/zenodo.17837448 Paper Download Link (Source) https://www.researchpublish.com/papers/minimum-augmented-zagreb-index-on-chemical-trees-with-given-number-of-pendent-vertices
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2025-12-06
- DOI
- https://doi.org/10.5281/zenodo.17837447
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00