Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
From MaRDI portal
Publication:5272634
DOI10.1002/jgt.22048zbMath1365.05249arXiv1507.08022OpenAlexW3122496659MaRDI QIDQ5272634
Publication date: 30 June 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.08022
Related Items (11)
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 ⋮ The number of spanning trees of a family of 2-separable weighted graphs ⋮ The enumeration of spanning tree of weighted graphs ⋮ Counting spanning trees in almost complete multipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The critical group of a clique-inserted graph
- A note on the critical group of a line graph
- Sandpile groups and spanning trees of directed line graphs
- Zeta functions and complexities of a semiregular bipartite graph and its line graph
- Clique-inserted-graphs and spectral dynamics of clique-inserting
- The critical group of a line graph
- On the number of spanning trees of some irregular line graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- The spectrum of infinite regular line graphs
- Oriented subtrees of an arc digraph
- Proofs from THE BOOK
This page was built for publication: Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
