On relation between the Kirchhoff index and number of spanning trees of graph
From MaRDI portal
Publication:5212894
DOI10.22049/cco.2019.26270.1088zbMath1449.05084OpenAlexW2946827662MaRDI QIDQ5212894
Edin Glogić, Marjan M. Matejić, Igor Ž. Milovanović, Emina I. Milovanović
Publication date: 30 January 2020
Full work available at URL: https://doaj.org/article/da7f004d91e646f5a4b608b7fc9abc98
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The best lower bound depended on two fixed variables for Jensen's inequality with ordered variables
- On relation between Kirchhoff index, Laplacian-energy-like invariant and Laplacian energy of graphs
- The Laplacian spectral radius of some graphs
- Laplacian matrices of graphs: A survey
- A sharp upper bound for the number of spanning trees of a graph
- On the Arithmetic and Geometric Means and on Holder's Inequality
- Two Remarks on the Kantorovich Inequality
This page was built for publication: On relation between the Kirchhoff index and number of spanning trees of graph
