Pages that link to "Item:Q2020012"
From MaRDI portal
The following pages link to The number of spanning trees of the Bruhat graph (Q2020012):
Displaying 10 items.
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs (Q1182967) (← links)
- Matrix-tree theorem of digraphs via signless Laplacians (Q2104963) (← links)
- The bridge number of arborescent links with many twigs (Q2699474) (← links)
- Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest (Q6047972) (← links)
- Counting spanning trees in a complete bipartite graph which contain a given spanning forest (Q6081889) (← links)
- Counting spanning trees with a Kekulé structure in linear hexagonal chains (Q6108002) (← links)
- On two conjectures concerning spanning tree edge dependences of graphs (Q6180563) (← links)
- Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink (Q6570976) (← 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)