Enumeration of Forests in a Graph

DOI10.2307/2044142zbMath0477.05039OpenAlexW4232455638MaRDI QIDQ3932827

No author found.

Publication date: 1981

Full work available at URL: https://doi.org/10.2307/2044142

zbMATH Keywords

enumeration of forestsformal sums of Kirchhoff matrices

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (12)

The number of rooted forests in circulant graphs ⋮ Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications ⋮ On the Jacobian group of a cone over a circulant graph ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ An Operator Approach to the Principle of Inclusion and Exclusion ⋮ On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph ⋮ On Operator and Formal Sum Methods for Graph Enumeration Problems ⋮ Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs ⋮ Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth ⋮ Counting rooted spanning forests in cobordism of two circulant graphs ⋮ An operator approach to some graph enumeration problems ⋮ Enumeration of connected spanning subgraphs of a planar graph

Cites Work

• On Operator and Formal Sum Methods for Graph Enumeration Problems
• Unnamed Item

This page was built for publication: Enumeration of Forests in a Graph