Asymptotic expansions for enumerating connected labelled graphs
Discrete Mathematics
2011-03-14 v1 Combinatorics
Abstract
I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k=m-n.
Keywords
Cite
@article{arxiv.1103.2251,
title = {Asymptotic expansions for enumerating connected labelled graphs},
author = {Keith Briggs},
journal= {arXiv preprint arXiv:1103.2251},
year = {2011}
}