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 条
  • [1] Complete Characterization of Chemical Trees with Maximal Augmented Zagreb Index
    Shao, Yanling
    Gao, Wei
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2023, 69 (05) : 3851 - 3870
  • [2] Complete Characterization of Chemical Trees with Maximal Augmented Zagreb Index
    Yanling Shao
    Wei Gao
    Journal of Applied Mathematics and Computing, 2023, 69 : 3851 - 3870
  • [3] On the Trees With Maximal Augmented Zagreb Index
    Lin, Wenshui
    Ali, Akbar
    Huang, Linshan
    Wu, Zhixi
    Chen, Jianfeng
    IEEE ACCESS, 2018, 6 : 69335 - 69341
  • [4] Complete Characterization of Trees with Maximal Augmented Zagreb Index (vol 83, pg 167, 2020)
    Xiao, Xiaoshi
    Qiu, Xiuliang
    Lin, Wenshui
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2022, 87 (01) : 171 - 176
  • [5] Maximal augmented Zagreb index of trees with given diameter
    Jiang, Yisheng
    Lu, Mei
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 395
  • [6] Maximal Augmented Zagreb Index of Trees With at Most Three Branching Vertices
    Cruz, Roberto
    Monsalve, Juan Daniel
    Rada, Juan
    IEEE ACCESS, 2019, 7 : 146652 - 146661
  • [7] Complete solution to open problems on exponential augmented Zagreb index of chemical trees
    Mondal, Sourav
    Das, Kinkar Chandra
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 482
  • [8] On chemical trees with minimum augmented Zagreb index
    Gao, Wei
    CONTRIBUTIONS TO MATHEMATICS, 2024, 9 : 1 - 10
  • [9] On the maximal augmented Zagreb index of unicyclic graphs with given girth
    Li, Yibo
    Zhang, Ruiting
    Fan, Qiong
    DISCRETE APPLIED MATHEMATICS, 2024, 356 : 238 - 246
  • [10] The k-apex trees with minimum augmented Zagreb index
    Liu, Muhuo
    Pang, Shumei
    Belardo, Francesco
    Ali, Akbar
    DISCRETE MATHEMATICS, 2023, 346 (07)