Pages that link to "Item:Q6081889"
From MaRDI portal
The following pages link to Counting spanning trees in a complete bipartite graph which contain a given spanning forest (Q6081889):
Displaying 6 items.
- Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest (Q6047972) (← links)
- Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink (Q6570976) (← links)
- Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip (Q6611077) (← links)
- The number of spanning trees in \(K_n\)-complement of a bipartite graph (Q6618161) (← links)
- Resistance distances and the Moon-type formula of a vertex-weighted complete split graph (Q6633516) (← links)
- Counting spanning trees of multiple complete split-like graph containing a given spanning forest (Q6646419) (← links)
