Title of article
On the first extended zeroth-order connectivity index of trees
Author/Authors
Wang، S نويسنده Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803-4918, USA Wang, S , Zhou، B نويسنده 2Department of Mathematics, South China Normal University, Guangzhou 510631, P. R. China Zhou, B
Issue Information
فصلنامه با شماره پیاپی 0 سال 2014
Pages
7
From page
213
To page
219
Abstract
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.
Journal title
Iranian Journal of Science and Technology Transaction A: Science
Serial Year
2014
Journal title
Iranian Journal of Science and Technology Transaction A: Science
Record number
1501712
Link To Document