@article { author = {Zhou, B. and Wang, S.}, title = {On the first extended zeroth-order connectivity index of trees}, journal = {Iranian Journal of Science}, volume = {38}, number = {3}, pages = {213-219}, year = {2014}, publisher = {Springer}, issn = {2731-8095}, eissn = {2731-8109}, doi = {10.22099/ijsts.2014.2263}, 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.}, keywords = {Zeroth-order connectivity index,extended zeroth-order connectivity index,trees, pendant vertices,degree of vertices}, url = {https://ijsts.shirazu.ac.ir/article_2263.html}, eprint = {https://ijsts.shirazu.ac.ir/article_2263_ad3da8d3561d639d9656cdcd4459f474.pdf} }