×

The asymptotic number of labeled graphs with given degree sequences. (English) Zbl 0402.05042


MSC:

05C30 Enumeration in graph theory
05A15 Exact enumeration problems, generating functions

Citations:

Zbl 0277.05002
PDFBibTeX XMLCite
Full Text: DOI

Online Encyclopedia of Integer Sequences:

Number of regular simple graphs on n labeled nodes.

References:

[1] Bender, E. A., Asymptotic methods in enumeration, SIAM Rev., 16, 485-515 (1974) · Zbl 0294.05002
[2] Bender, E. A., The asymptotic number of non-negative integer matrices with given row and column sums, Discrete Math., 10, 217-223 (1974) · Zbl 0293.05009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.