Pages that link to "Item:Q5037930"
From MaRDI portal
The following pages link to The number of rooted forests in circulant graphs (Q5037930):
Displaying 5 items.
- Rooted forests that avoid sets of permutations (Q1715620) (← links)
- A counting formula for labeled, rooted forests (Q5960005) (← links)
- Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications (Q6096283) (← links)
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)
- On the structure of Laplacian characteristic polynomial of circulant graphs (Q6545162) (← links)