Enumeration of graphs with given weighted number of connected components

DOI10.4134/BKMS.B150921MaRDI QIDQ4968685zbMATH OpenFDO

Authors Joung Min Song

Publication date 16 July 2019

Full work available at URL https://arxiv.org/abs/1606.08001

zbMATH Keywords

\(q\)-partite graphsgenerating functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Connectivity (05C40)

Abstract: We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given order, size and number of connected components.

Recommendations

• On the enumeration of certain weighted graphs
• Generating function for representations of graphs by k-partite graphs
• The enumeration of labeled graphs by number of cutpoints
• ENUMERATION OF WEIGHTED COMPLETE GRAPHS
• Enumeration of labeled connected graphs with given order and size

Cites work

• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. II
• Enumeration of Bicolourable Graphs
• Enumeration of bipartite self-complementary graphs
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• On certain hyperplane arrangements and colored graphs
• On the number of bi-colored graphs
• The enumeration of bipartite graphs
• The Number of k-Coloured Graphs on Labelled Nodes

Cited in

(5)

• Counting enriched multigraphs according to the number of their edges (or arcs)
• The \(Q\)-generating function for graphs with application
• Generating function for representations of graphs by k-partite graphs
• ENUMERATION OF WEIGHTED COMPLETE GRAPHS
• On the enumeration of certain weighted graphs

This page was built for publication: Enumeration of graphs with given weighted number of connected components

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