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.
Publisher
Centre for Evaluation in Education and Science (CEON/CEES)
Subject
General Earth and Planetary Sciences,General Environmental Science
Reference21 articles.
1. D. ANDRICA, C. BADEA, Grüs inequality for positive linear functions, Peroid. Math. Hungar. 19 (1988) 155-167;
2. S . B. BOZKURT,Upper bounds for the number of spanning trees of graphs, J. Inequal. Appl. 2012:269 (2012);
3. S¸ . B. BOZKURT, D. BOZKURT, On the sum of powers of normalized Laplacian eigenvalues of graphs, MATCH Commun. Math. Comput. Chem. 68 (2012) 917-930;
4. M. CAVERS, S. FALLAT, S. KIRKLAND, ON THE NORMALIZED LAPLACIAN ENERGY AND RANDI'CRANDI' RANDI'C INDEX R -1 OF GRAPHS, Lin. Algebra Appl. 433 (1) (2010) 172-190;
5. H. CHEN, F. ZHANG, Resistance distance and the normalized Laplacian spectrum, Discr. Appl. Math. 155 (2007) 654-661;