On the degree Kirchhoff index of bipartite graphs
Abstract:
Let G = (V,E), V = {v1, v2,…, vn}, be a connected graph of order n and size m. Denote by g1 ≥ g2 ≥ ··· ≥ gn-1 > gn = 0 the normalized Laplacian eigenvalues of G. The degree Kirchhoff index is defined as K f * (G) = 2m∑ n-1 i=1 1 gi . In this paper, we obtain some improved lower bounds on the degree Kirchhoff index of bipartite graphs.