On lower bounds for the Kirchhoff index
Let G be a simple graph of order n ≥ 2 with m edges. Denote by d1 ≥ d2 ≥ · · · ≥ dn > 0 the sequence of vertex degrees and by μ1 ≥ μ2 ≥ · · · ≥ μn−1 > μn = 0 the Laplacian eigenvalues of the graph G. Lower bounds for the Kirchhoff index, Kf(G) = n Σ −1 i=1 1 μi, are obtained....
Main Authors: | Milovanović I.Ž. 0000-0003-2209-9606, Milovanović E.I. |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Kragujevac, Faculty of Science
2017-01-01
|
Series: | Kragujevac Journal of Science |
Online Access: | http://scindeks-clanci.ceon.rs/data/pdf/1450-9636/2017/1450-96361739077M.pdf |
Similar Items
-
On relation between the Kirchhoff index and number of spanning trees of graph
by: Igor Milovanovic, et al.
Published: (2020-06-01) -
Upper and Lower Bounds for the Kirchhoff Index of the n-Dimensional Hypercube Network
by: Jia-Bao Liu, et al.
Published: (2020-01-01) -
Some Bounds for the Kirchhoff Index of Graphs
by: Yujun Yang
Published: (2014-01-01) -
Bounds for the Kirchhoff Index of Bipartite Graphs
by: Yujun Yang
Published: (2012-01-01) -
Some new upper bounds for the hyper-Zagreb index
by: Emina Milovanovic, et al.
Published: (2019-01-01)