o:29010 On relation between the Kirchhoff index and number of spanning trees of graph en Abstract:Let G be a simple connected graph with degree sequence (d_1,d_2, … ,d_n) where Δ=d_1≥d_2≥⋯≥d_n=δ>0 and let μ_1≥μ_2≥⋯≥μ_(n-1)>μ_n=0 be the Laplacian eigenvalues of G. Let Kf(G)=n∑_(i=1)^(n-1)▒1/μ_i and τ(G)=1/n ∏_(i=1)^(n-1)▒μ_i denote the Kirchhoff index and the number of spanning trees of G, respectively. In this paper we establish several lower bounds for Kf(G) in terms of τ(G), the order, the size and maximum degree of G. Keywords:Topological indices, Kirchhoff index, spanning trees 1552099 10.22049/CCO.2019.26270.1088 1552101 2538-2128 2023-05-04T08:08:59.909Z 44 no 46 Edin Glogić Državni univerzitet u Novom Pazaru 0000-0001-6295-8298 Igor Milovanović person 0000-0003-2209-9606 Emina Milovanović person 0000-0002-1905-4813 application/pdf 401425 https://phaidrabg.bg.ac.rs/o:29010 no yes 1 70 92000001 20A01 Communications in Combinatorics and Optimization 5 1 1 8 2020