Highly Influenced

# Trees of extremal connectivity index

@article{Liu2006TreesOE, title={Trees of extremal connectivity index}, author={Huiqing Liu and Mei Lu and Feng Tian}, journal={Discrete Applied Mathematics}, year={2006}, volume={154}, pages={106-119} }

- Published in Discrete Applied Mathematics 2006
DOI:10.1016/j.dam.2004.10.009

The connectivity index w (G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w1(T ). Also, for −1 < 0, we give a sharp lower bound and a upper bound for w (T ). © 2005 Elsevier B.V. All rights reserved.