Complete Characterization of Trees with Maximal Augmented Zagreb Index

被引:0
|
作者
Lin, Wenshui [1 ,2 ]
Dimitrov, Darko [3 ,4 ]
Skrekovski, Riste [4 ,5 ]
机构
[1] Xiamen Univ, Fujian Key Lab Sensing & Comp Smart City, Xiamen 361005, Peoples R China
[2] Xiamen Univ, Sch Informat, Xiamen 361005, Peoples R China
[3] Hsch Tech & Wirtschaft Berlin, Berlin, Germany
[4] Fac Informat Studies, Novo Mesto, Slovenia
[5] Univ Ljubljana, Fac Math & Phys, Ljubljana, Slovenia
基金
中国国家自然科学基金;
关键词
ATOM-BOND CONNECTIVITY; MINIMAL ABC INDEX; STRUCTURAL-PROPERTIES; EFFICIENT COMPUTATION; COMPUTER-SEARCH; PENDENT PATHS; GRAPHS; BOUNDS; CONJECTURE; NUMBER;
D O I
暂无
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The augmented Zagreb index (AZI) of an n-vertex graph G = (V, E) is defined as AZI(G) = Sigma(vivj is an element of E)[d(i)d(j)/(d(i) + d(j) - 2)](3), where V = {v(0), v(1), ..., v(n-1)},n > 3, and d(i) denotes the degree of vertex v(i) of G. As a variant of the well-known atom-bond connectivity index, the AZI was shown to have the best predicting ability for a variety of physicochemical properties among several tested vertex-degree-based topological indices. In 2010 Furtula et al. [J. Math. Chem. 48 (2010) 370] proposed the problem of characterizing n-vertex tree(s) with maximal AZI. In the present paper we solve this problem by proving that the n-vertex balanced double star uniquely maximizes AZI if n >= 19.
引用
收藏
页码:167 / 178
页数:12
相关论文
共 50 条
  • [31] Augmented Zagreb Index: Extremal Results and Bounds
    Ali, Akbar
    Furtula, Boris
    Gutman, Ivan
    VukiceviC, Damir
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021, 85 (02) : 211 - 244
  • [32] Maximal hyper-Zagreb index of trees, unicyclic and bicyclic graphs with a given order and matching number
    Liu, Hechao
    Tang, Zikai
    DISCRETE MATHEMATICS LETTERS, 2020, 4 : 11 - 18
  • [33] The minimal augmented Zagreb index of k-apex trees for k ∈ {1,2,3}
    Cheng, Kun
    Liu, Muhuo
    Belardo, Francesco
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 402
  • [34] The minimal augmented Zagreb index of k-apex trees for k∈{1,2,3}
    Cheng, Kun
    Liu, Muhuo
    Belardo, Francesco
    Applied Mathematics and Computation, 2021, 402
  • [35] Modified Zagreb index and total domination in trees
    Kumar, H. Naresh
    Senthilkumar, B.
    Balachandran, S.
    Venkatakrishnan, Y. B.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2025, 17 (02)
  • [36] EXPONENTIAL SECOND ZAGREB INDEX OF CHEMICAL TREES
    Balachandran, Selvaraj
    Vetrik, Tomas
    TRANSACTIONS ON COMBINATORICS, 2021, 10 (02) : 25 - 34
  • [37] Bounds on the first leap Zagreb index of trees
    Dehgardi, N.
    Aram, H.
    CARPATHIAN MATHEMATICAL PUBLICATIONS, 2021, 13 (02) : 377 - 385
  • [38] ORDERING OF TREES BY MULTIPLICATIVE SECOND ZAGREB INDEX
    Eliasi, Mehdi
    Ghalavand, Ali
    TRANSACTIONS ON COMBINATORICS, 2016, 5 (01) : 49 - 55
  • [39] The neighborhood version of the hyper Zagreb index of trees
    Dehgardi, Nasrin
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024,
  • [40] MAXIMAL GRAPHS OF THE FIRST REVERSE ZAGREB BETA INDEX
    Ediz, S.
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2018, 8 (1A): : 306 - 310