Maximal augmented Zagreb index of trees with given diameter

Yisheng Jiang and Mei Lu

Applied Mathematics and Computation, 2021, vol. 395, issue C

Abstract: Let G=(V,E) be an n-vertex graph, where V={v0,v1,…,vn−1}. The augmented Zagreb index (AZI) of G is defined as AZI(G)=∑vivj∈E[didj/(di+dj−2)]3, where di is the degree of vi. Let Tnd be the set of all trees on n vertices with given diameter d. In this paper, we determine the tree with maximum AZI among Tnd when n≥32(d−1)+381. Our result partially resolve a problem given in [12].

Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320308080
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:395:y:2021:i:c:s0096300320308080

DOI: 10.1016/j.amc.2020.125855

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().