Enumeration of graphs with given weighted number of connected components

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.

Cited by in corpus (1)

• Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements ${\mathcal{J}}_n$