The k-apex trees with minimum augmented Zagreb index
Abstract
For a connected graph G on at least three vertices, the augmented Zagreb index (AZI) of G is defined as AZI(G)=Σuv∈ E(G)(d(u)d(v)d(u)+d(v)-2)3, being a topological index well-correlated with the formation heat of heptanes and octanes. A k-apex tree G is a connected graph admitting a k-subset X⊂ V(G) such that G-X is a tree, while G-S is not a tree for any S⊂ V(G) of cardinality less than k. By investigating some structural properties of k-apex trees, we identify the graphs minimizing the AZI among all k-apex trees on n vertices for k 4 and n 3(k+1). The latter solves an open problem posed in [K. Cheng, M. Liu, F. Belardo, Appl. Math. Comput., 402 (2021), 126139].
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.