Ordering connected graphs by their Kirchhoff indices
From MaRDI portal
Publication:2957754
DOI10.1080/00207160.2015.1073722zbMath1354.05084arXiv1602.07039OpenAlexW3104383933MaRDI QIDQ2957754
Kexiang Xu, Kinkar Chandra Das, Xiao Dong Zhang
Publication date: 27 January 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07039
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (7)
On the normalized Laplacian spectral radii of a graph and its line graph ⋮ Maximum resistance-Harary index of cacti ⋮ Maximum reciprocal degree resistance distance index of unicyclic graphs ⋮ Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach ⋮ On the ordering of the Kirchhoff indices of the complements of trees and unicyclic graphs ⋮ Comparison of the Wiener and Kirchhoff indices of random pentachains ⋮ Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotic Laplacian-energy-like invariant of lattices
- Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers
- Comparison between Kirchhoff index and the Laplacian-energy-like invariant
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs
- Laplacian matrices of graphs: A survey
- A certain polynomial of a graph and graphs with an extremal number of trees
- An improved upper bound for Laplacian graph eigenvalues
- On the Kirchhoff index of graphs with diameter 2
- A recursion formula for resistance distances and its applications
- The Kirchhoff index of subdivisions of graphs
- The Laplacian Spectrum of a Graph
- The number of spanning trees of a graph with given matching number
This page was built for publication: Ordering connected graphs by their Kirchhoff indices
