The harmonic index for graphs

The harmonic index of a graph G is defined as the sum of the weights 2 d ( u ) + d ( v ) of all edges u v of G , where d ( u ) denotes the degree of a vertex u in G . 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.