On Operator and Formal Sum Methods for Graph Enumeration Problems

DOI10.1137/0605038MaRDI QIDQ3342592zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0605038

zbMATH Keywords

cyclomatic numbergraphical enumerationplanar graphspanning forestspanning subgraph

Mathematics Subject Classification ID

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

Recommendations

• An algebraic representation of graphs and applications to graph enumeration
• An invariant theory approach to graph enumeration
• scientific article; zbMATH DE number 1225794
• scientific article; zbMATH DE number 742845
• On optimum summable graphs
• Graph-based counting theory and its applications
• Solution to an open problem on the integral sum graphs
• scientific article; zbMATH DE number 861307
• Constructive enumeration of graphs
• Enumerative applications of a decomposition for graphs and digraphs

Cites work

• An operator approach to some graph enumeration problems
• Enumeration of connected spanning subgraphs of a planar graph
• Enumeration of Forests in a Graph
• scientific article; zbMATH DE number 3152798 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)

Cited in

(7)

• On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph
• Enumeration of Hamiltonian Cycles and Paths in a Graph
• An Operator Approach to the Principle of Inclusion and Exclusion
• Enumeration of Forests in a Graph
• Countingk-component forests of a graph
• scientific article; zbMATH DE number 3327133 (Why is no real title available?)
• Introduction to graph enumerations

This page was built for publication: On Operator and Formal Sum Methods for Graph Enumeration Problems

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