Enumeration of graphs with given weighted number of connected components
Combinatorics
2016-06-28 v1
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.
Keywords
Cite
@article{arxiv.1606.08001,
title = {Enumeration of graphs with given weighted number of connected components},
author = {Joungmin Song},
journal= {arXiv preprint arXiv:1606.08001},
year = {2016}
}