Bounds and extremal graphs for Harary energy
Abstract
Let be a connected graph of order and let be the reciprocal distance matrix (also called Harary matrix) of the graph . Let be the eigenvalues of the reciprocal distance matrix of the connected graph called the reciprocal distance eigenvalues of . The Harary energy of a connected graph is defined as sum of the absolute values of the reciprocal distance eigenvalues of , that is, In this paper, we establish some new lower and upper bounds for in terms of different graph parameters associated with the structure of the graph . We characterize the extremal graphs attaining these bounds. We also obtain a relation between the Harary energy and the sum of largest adjacency eigenvalues of a connected graph.
Communicated by Cunquan Zhang