On relation between the Kirchhoff index and number of spanning trees of graph
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.
engleski
2020
© All rights reserved
Keywords:Topological indices, Kirchhoff index, spanning trees