|
|
|
|
On Relation Between the Kirchhoff Index and Number of Spanning Trees of Graph
|
|
|
|
|
|
|
|
نویسنده
|
Milovanovic Igor ,Glogic Edin ,Matejic Marjan ,Milovanovic Emina
|
|
منبع
|
Communications In Combinatorics And Optimization - 2020 - دوره : 5 - شماره : 1 - صفحه:1 -8
|
|
|
|
|
چکیده
|
Let g be a simple connected graph with degree sequence (d1,d2,…,dn) where δ=d1≥d2≥⋯≥dn=δ>0 and let μ1≥μ2≥⋯≥μn−1>μn=0 be the laplacian eigenvalues of g. let kf(g)=n∑n−1i=11μi and τ(g)=1n∏n−1i=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.
|
|
کلیدواژه
|
Topological Indices ,Kirchhoff Index ,Spanning Trees
|
|
آدرس
|
Faculty Of Electronic Engineering, Serbia, State University Of Novi Pazar, Serbia, Faculty Of Electronic Engineering, Serbia, Faculty Of Electronic Engineering, Serbia
|
|
پست الکترونیکی
|
ema@elfak.ni.ac.rs
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|