Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2025
License: CC BY
Data sources: ZENODO
ZENODO
Article . 2025
License: CC BY
Data sources: Datacite
ZENODO
Article . 2025
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

Minimum Augmented Zagreb Index on Chemical Trees with Given Number of Pendent Vertices

Authors: Fuqin Zhan;

Minimum Augmented Zagreb Index on Chemical Trees with Given Number of Pendent Vertices

Abstract

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

Keywords

Topological indices, Extremal graphs, Chemical trees, Augmented Zagreb index

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green