Trees of extremal connectivity index Original Research Article

The connectivity index image of a graph G is the sum of the weights image of all edges image of G, where image is a real number (image, and image 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 image. Also, for image, we give a sharp lower bound and a upper bound for image.