The harmonic index for graphs

The harmonic index of a graph GG is defined as the sum of the weights 2d(u)+d(v) of all edges uvuv of GG, where d(u)d(u) denotes the degree of a vertex uu in GG. In this work, we present the minimum and maximum values of the harmonic index for simple connected graphs and trees, and characterize the corresponding extremal graphs.