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
相关论文
共 70 条
[1]  
[Anonymous], 2013, Modern graph theory
[2]  
BALABAN AT, 1983, TOP CURR CHEM, V114, P21
[3]   RECENT DEVELOPMENTS IN TREE-PRUNING METHODS AND POLYNOMIALS FOR CACTUS GRAPHS AND TREES [J].
Balasubramanian, K. .
JOURNAL OF MATHEMATICAL CHEMISTRY, 1990, 4 (01) :89-102
[4]  
Basak S.C., 1999, TOPOLOGICAL INDICES, P675
[5]  
Basak SC, 1997, CHEM TOPOLOGY 3 DIME, P73
[6]   Extremal graphs for weights [J].
Bollobás, B ;
Erdos, P ;
Sarkar, A .
DISCRETE MATHEMATICS, 1999, 200 (1-3) :5-19
[7]  
Bollobás B, 1998, ARS COMBINATORIA, V50, P225
[8]   Enumeration of m-ary cacti [J].
Bóna, M ;
Bousquet, M ;
Labelle, G ;
Leroux, P .
ADVANCES IN APPLIED MATHEMATICS, 2000, 24 (01) :22-56
[9]   Overall molecular descriptors. 3. Overall Zagreb indices [J].
Bonchev, D ;
Trinajstic, N .
SAR AND QSAR IN ENVIRONMENTAL RESEARCH, 2001, 12 (1-2) :213-236
[10]  
BONDY JA, 1976, GRAPH THEORY ITS APP