Sharp bounds on Zagreb indices of cacti with k pendant vertices

被引:38
|
作者
Li, Shuchao [1 ]
Yang, Huangxu [1 ]
Zhao, Qin [1 ]
机构
[1] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China
基金
中国国家自然科学基金;
关键词
Zagreb indices; Cactus graphs; Pendant vertex; CONNECTIVITY INDEX; GRAPH-THEORY; MOLECULAR CONNECTIVITY; TOPOLOGICAL INDEXES; 2ND-ZAGREB INDEX; UNIFIED APPROACH; RANDIC INDEX; TREES; ORBITALS; MAXIMUM;
D O I
10.2298/FIL1206189L
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For a (molecular) graph, the first Zagreb index M-1 is equal to the sum of squares of its vertex degrees, and the second Zagreb index M-2 is equal to the sum of products of degrees of pairs of adjacent vertices. A connected graph G is a cactus if any two of its cycles have at most one common vertex. In this paper, we investigate the first and the second Zagreb indices of cacti with k pendant vertices. We determine sharp bounds for M-1-, M-2-values of n-vertex cacti with k pendant vertices. As a consequence, we determine the n-vertex cacti with maximal Zagreb indices and we also determine the cactus with a perfect matching having maximal Zagreb indices.
引用
收藏
页码:1189 / 1200
页数:12
相关论文
共 50 条
  • [21] BOUNDS OF ZAGREB INDICES AND HYPER ZAGREB INDICES
    Wang, Shaohui
    Gao, Wei
    Jamil, Muhammad K.
    Farahani, Mohammad R.
    Liu, Jia-Bao
    MATHEMATICAL REPORTS, 2019, 21 (01): : 93 - 102
  • [22] Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
    Li, Shuchao
    Zhang, Minjie
    APPLIED MATHEMATICS LETTERS, 2011, 24 (02) : 131 - 137
  • [23] Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
    Faculty of Mathematics and Statistics, Central China Normal University, Wuhan 430079, China
    不详
    Appl Math Lett, 2 (131-137):
  • [24] The Merrifield-Simmons indices and Hosoya indices of trees with k pendant vertices
    Yu, Aimei
    Lv, Xuezheng
    JOURNAL OF MATHEMATICAL CHEMISTRY, 2007, 41 (01) : 33 - 43
  • [25] Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
    He, Xiaocong
    Li, Shuchao
    Zhao, Qin
    DISCRETE APPLIED MATHEMATICS, 2019, 271 : 49 - 63
  • [26] Bounds for Zagreb Indices
    Borovicanin, Bojana
    Das, Kinkar Ch.
    Furtula, Boris
    Gutman, Ivan
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2017, 78 (01) : 17 - 100
  • [27] Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
    Li, Shuchao
    Zhao, Qin
    MATHEMATICAL AND COMPUTER MODELLING, 2011, 54 (11-12) : 2869 - 2879
  • [28] Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter
    Wang, Chunxiang
    Liu, Jia-Bao
    Wang, Shaohui
    DISCRETE APPLIED MATHEMATICS, 2017, 227 : 156 - 165
  • [29] New Bounds on Zagreb indices and the Zagreb Co-indices
    Ranjinj, P. S.
    Lokesha, V.
    Bindusree, M.
    Raju, M. Phani
    BOLETIM SOCIEDADE PARANAENSE DE MATEMATICA, 2013, 31 (01): : 51 - 55
  • [30] EXTREMAL F-INDICES FOR BICYCLIC GRAPHS WITH k PENDANT VERTICES
    Amin, Ruhul
    Abu Nayeem, Sk. Md.
    JOURNAL OF THE KOREAN SOCIETY OF MATHEMATICAL EDUCATION SERIES B-PURE AND APPLIED MATHEMATICS, 2020, 27 (04): : 171 - 186