An Improved Lower Bound for the Degree Kirchhoff Index of Bipartite Graphs
From MaRDI portal
Publication:5051424
DOI10.47443/dml.2021.0118OpenAlexW4205368800MaRDI QIDQ5051424
No author found.
Publication date: 23 November 2022
Published in: Discrete Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.47443/dml.2021.0118
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on normalized Laplacian eigenvalues of graphs
- Upper bounds for the number of spanning trees of graphs
- Nordhaus-Gaddum-type results for resistance distance-based graph invariants
- Resistance distance and the normalized Laplacian spectrum
- On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs
- On resistance-distance and Kirchhoff index
- Laplacian matrices of graphs: A survey
- On the Randić incidence energy of graphs
- Bounding the sum of powers of normalized Laplacian eigenvalues of a graph
- On Kirchhoff and degree Kirchhoff indices
This page was built for publication: An Improved Lower Bound for the Degree Kirchhoff Index of Bipartite Graphs