Answers are grounded in this paper and cite their sources.
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 ).
No takes yet. Share an insight, caveat, or question.
Yilun Shang (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: