The following pages link to Enumeration of Forests in a Graph (Q3932827):
Displaying 12 items.
- Counting rooted spanning forests in cobordism of two circulant graphs (Q779138) (← links)
- An operator approach to some graph enumeration problems (Q1050351) (← links)
- Enumeration of connected spanning subgraphs of a planar graph (Q1053032) (← links)
- On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph (Q1207353) (← links)
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs (Q2286143) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- On Operator and Formal Sum Methods for Graph Enumeration Problems (Q3342592) (← links)
- An Operator Approach to the Principle of Inclusion and Exclusion (Q3718721) (← links)
- The number of rooted forests in circulant graphs (Q5037930) (← links)
- Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications (Q6096283) (← links)
- On the Jacobian group of a cone over a circulant graph (Q6117337) (← links)
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)
