English

The $k$-apex trees with minimum augmented Zagreb index

Combinatorics 2022-05-31 v1

Abstract

For a connected graph GG on at least three vertices, the augmented Zagreb index (AZI) of GG is defined as AZI(G)=uvE(G)(d(u)d(v)d(u)+d(v)2)3,AZI(G)=\sum_{uv\in E(G)}\left(\frac{d(u)d(v)}{d(u)+d(v)-2}\right)^{3}, being a topological index well-correlated with the formation heat of heptanes and octanes. A kk-apex tree GG is a connected graph admitting a kk-subset XV(G)X\subset V(G) such that GXG-X is a tree, while GSG-S is not a tree for any SV(G)S\subset V(G) of cardinality less than kk. By investigating some structural properties of kk-apex trees, we identify the graphs minimizing the AZI among all kk-apex trees on nn vertices for k4k\ge 4 and n3(k+1)n\ge 3(k+1). The latter solves an open problem posed in [K. Cheng, M. Liu, F. Belardo, {\em Appl. Math. Comput.}, {\bf402} (2021), 126139].

Cite

@article{arxiv.2205.15220,
  title  = {The $k$-apex trees with minimum augmented Zagreb index},
  author = {Muhuo Liu and Shumei Pang and Francesco Belardo and Akbar Ali},
  journal= {arXiv preprint arXiv:2205.15220},
  year   = {2022}
}
R2 v1 2026-06-24T11:33:22.002Z