%0 Journal Article
%T On the first extended zeroth-order connectivity index of trees
%J Iranian Journal of Science and Technology (Sciences)
%I Springer
%Z 1028-6276
%A Zhou, B.
%A Wang, S.
%D 2014
%\ 09/01/2014
%V 38
%N 3
%P 213-219
%! On the first extended zeroth-order connectivity index of trees
%K Zeroth-order connectivity index
%K extended zeroth-order connectivity index
%K trees, pendant vertices
%K degree of vertices
%R 10.22099/ijsts.2014.2263
%X 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.
%U http://ijsts.shirazu.ac.ir/article_2263_ad3da8d3561d639d9656cdcd4459f474.pdf