Graph Theory With Applications
Graph Theory With Applications
Note: Resistance distance and the normalized Laplacian spectrum
Discrete Applied Mathematics
Kirchhoff index of composite graphs
Discrete Applied Mathematics
Hi-index | 0.04 |
In this paper, we consider the asymptotic behavior of the number of spanning trees and the Kirchhoff index of iterated line graphs and iterated para-line graphs (or clique-inserted graphs) of a regular graph G. We show that the asymptotic behavior of these indices (except the Kirchhoff index of the iterated para-line graphs) is independent of the structure of the regular graph G.