Improved bounds for Kirchhoff index of graphs.

Let G be a simple connected graph with n vertices. The Kirchhoff index of G is defined as Kf (G) = n Pn1 i=1 > n = 0 are the Laplacian eigenvalues of G. Some bounds on Kf (G) in terms of graph parameters such as the number of vertices, the number of edges, first Zagreb index, forgotten topological index, etc., are presented. These bounds improve some previously known bounds in the literature. [ABSTRACT FROM AUTHOR]