TY - JOUR
ID - 13574
TI - On trees and the multiplicative sum Zagreb index
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Eliasi, Mehdi
AU - Ghalavand, Ali
AD - Dept. of Mathematics, Khansar Faculty of Mathematics and Computer Science,
Khansar, Iran,
AD - Dept. of Mathematics, Khansar Faculty of Mathematics and Computer Science,
Khansar, Iran
Y1 - 2016
PY - 2016
VL - 1
IS - 2
SP - 137
EP - 148
KW - Multiplicative Sum Zagreb Index
KW - Graph Transformation
KW - Branching Point
KW - trees
DO - 10.22049/cco.2016.13574
N2 - For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as $Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$. In this paper, we first introduce some graph transformations that decrease this index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb indices among all trees of order $ngeq 13$.
UR - http://comb-opt.azaruniv.ac.ir/article_13574.html
L1 - http://comb-opt.azaruniv.ac.ir/article_13574_13979e274d477e710da9e35a059bc605.pdf
ER -