The kk-apex trees with minimum augmented Zagreb index

preprint2022arXivOpen access

Abstract

For a connected graph GG on at least three vertices, the augmented Zagreb index (AZI) of GG is defined as AZI(G)=∑uv∈E(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 X⊂V(G)X\subset V(G) such that G−XG-X is a tree, while G−SG-S is not a tree for any S⊂V(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 k≥4k\ge 4 and n≥3(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].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.