2018 Abstract: Let G=(V,E),V={1,2,…,n}, be a simple connected graph of order n and size m, with sequence of vertex degrees degree 〖Δ=d〗_1≥d_2≥⋯≥d_n=δ >0 , d_i=d(i). Denote by μ_1≥μ_2≥⋯≥μ_n=0 the Laplacian eigenvalues of G. Further, denote with Kf(G)=n∑_(i=1)^(n-1)▒1/μ_i and τ(G)=1/n ∏_(i=1)^(n-1)▒μ_i , the Kirchhoff index and the number of spanning trees of G, respectively. In this paper we determine several lower bounds for Kf(G) depending on τ(G) and some of the graph parameters n, m od Δ. info:eu-repo/semantics/article https://phaidrabg.bg.ac.rs/o:29035 ISSN: 2217-5539 All rights reserved On some lower bounds for the Kirchhoff index eng Keywords: Topological indices, vertex degree, Kirchhoff index application/pdf 49758 bytes Scientific Publications of the State University of Novi Pazar, Ser. A: Appl. Math. Inform. and Mech. 10(2) Glogić, Edin Matejić, Marjan Milovanović, I. Ž. Milovanović, E. I.