TY - JOUR
ID - 2263
TI - On the first extended zeroth-order connectivity index of trees
JO - Iranian Journal of Science and Technology (Sciences)
JA - IJSTS
LA - en
SN - 1028-6276
AU - Zhou, B.
AU - Wang, S.
AD - 2Department of Mathematics, South China Normal University, Guangzhou 510631, P. R. China
AD - Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803-4918, USA
Y1 - 2014
PY - 2014
VL - 38
IS - 3
SP - 213
EP - 219
KW - Zeroth-order connectivity index
KW - extended zeroth-order connectivity index
KW - trees, pendant vertices
KW - degree of vertices
DO - 10.22099/ijsts.2014.2263
N2 - The first extended zeroth-order connectivity index of a graph
G is defined as 0 1/2
1
( )
( ) ,
v
v V G
G D
where
V
(G) is the vertex set of G, and v D is the sum of degrees of neighbors of vertex v in G. We give a sharp
lower bound for the first extended zeroth-order connectivity index of trees with given numbers of vertices and
pendant vertices, and characterize the extremal trees. We also determine the
n-vertex trees with the first three
smallest first extended zeroth-order connectivity indices.
UR - http://ijsts.shirazu.ac.ir/article_2263.html
L1 - http://ijsts.shirazu.ac.ir/article_2263_ad3da8d3561d639d9656cdcd4459f474.pdf
ER -