On Harary index of graphs

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. For a connected graph G=(V,E) and two nonadjacent vertices v sub(i and v) sub(j) in V(G) of G, recall that G+v sub(iv) sub(j) is the supergraph formed from G by adding an edge between vertices v sub(i and v) sub(j). Denote the Harary index of G and G+v sub(iv) sub(j) by H(G) and H(G+v sub(iv) sub(j)), respectively. We obtain lower and upper bounds on H(G+v sub(iv) sub(j))-H(G), and characterize the equality cases in those bounds. Finally, in this paper, we present some lower and upper bounds on the Harary index of graphs with different parameters, such as clique number and chromatic number, and characterize the extremal graphs at which the lower or upper bounds on the Harary index are attained.