Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
From MaRDI portal
Publication:6047972
DOI10.1002/jgt.22954zbMath1522.05213OpenAlexW4361269909MaRDI QIDQ6047972
Danyi Li, Wuxian Chen, Weigen Yan
Publication date: 10 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22954
complete bipartite graphspanning treecomplete multipartite graphvertex-weighted graphmesh-star transformation
Cites Work
- Unnamed Item
- Unnamed Item
- Enumerating spanning trees of graphs with an involution
- Determinant identities for Laplace matrices
- The number of spanning trees of the Bruhat graph
- The enumeration of spanning tree of weighted graphs
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- Linear algebraic techniques for weighted spanning tree enumeration
- On the number of spanning trees of some irregular line graphs
- A simple formula for the number of spanning trees of line graphs
- Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
- The second moment of the complexity of a graph
- Counting spanning trees in a complete bipartite graph which contain a given spanning forest
This page was built for publication: Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest