Beschreibung:
<jats:p>Let G be a connected graph of order n with Laplacian eigenvalues μ1 ≥ μ2 ≥ ... ≥ μn-1 > mn = 0. </jats:p>
<jats:p>The Kirchhoff index of G is defined as [xxx] </jats:p>
<jats:p>In this paper. we give lower and upper bounds on Kf of graphs in terms on n, number of edges, maximum degree, and number of spanning trees. Moreover, we present lower and upper bounds on the Nordhaus-Gaddum-type result for the Kirchhoff index. </jats:p>