A simple formula for the number of spanning trees of line graphs

DOI10.1002/JGT.22212zbMath1395.05081OpenAlexW2767546365MaRDI QIDQ4575533

Helin Gong, Xian'an Jin

Publication date: 13 July 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22212

zbMATH Keywords

subdivisionline graphselectrical networksspanning treesmesh-star transformation

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Related Items (15)

On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs ⋮ Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest ⋮ Counting spanning trees in a complete bipartite graph which contain a given spanning forest ⋮ Counting spanning trees with a Kekulé structure in linear hexagonal chains ⋮ Oriented spanning trees and stationary distribution of digraphs ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ Unnamed Item ⋮ Enumeration of spanning trees of middle graphs ⋮ Express the number of spanning trees in term of degrees ⋮ Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip ⋮ The number of spanning trees in \(K_n\)-complement of a bipartite graph ⋮ Resistance distances and the Moon-type formula of a vertex-weighted complete split graph ⋮ The enumeration of spanning tree of weighted graphs ⋮ Resistance distances in generalized join graphs ⋮ Counting spanning trees in almost complete multipartite graphs

This page was built for publication: A simple formula for the number of spanning trees of line graphs