Enumeration of Forests in a Graph

DOI10.2307/2044142MaRDI QIDQ3932827zbMATH OpenOpenAlexFDO

Authors

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

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

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On Operator and Formal Sum Methods for Graph Enumeration Problems

Cited in

(13)

• An operator approach to some graph enumeration problems
• Enumeration of connected spanning subgraphs of a planar graph
• On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph
• 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
• On Operator and Formal Sum Methods for Graph Enumeration Problems
• An Operator Approach to the Principle of Inclusion and Exclusion
• 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
• Bizonotopal graphical algebras
• Counting rooted spanning forests in cobordism of two circulant graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3932827)