As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G. In this paper we obtain a closed-form formula for the enumeration of spanning trees in Г(G), employing the theory of electrical networks. We present bounds for the largest and second smallest Laplacian eigenvalues of Г(G) in terms of the maximum degree, the number of edges, and the first Zagreb index of G. In addition, we establish upper and lower bounds for the Laplacian Estrada index of Г(G) based on the vertex degrees of G. These bounds are also connected with the number of spanning trees in Г(G).
@article{bwmeta1.element.doi-10_1515_math-2016-0055,
author = {Yilun Shang},
title = {On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs},
journal = {Open Mathematics},
volume = {14},
year = {2016},
pages = {641-648},
zbl = {1346.05177},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_1515_math-2016-0055}
}
Yilun Shang. On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs. Open Mathematics, Tome 14 (2016) pp. 641-648. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_1515_math-2016-0055/