Ordering connected graphs by their Kirchhoff indices
Ordering connected graphs by their Kirchhoff indices
The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all unordered pairs of vertices, which was introduced by Klein and Randić. In this paper, we characterize all extremal graphs with respect to Kirchhoff index among all graphs obtained by deleting p edges from a …