Bender, Edward A.; Canfield, E. Rodney The asymptotic number of labeled graphs with given degree sequences. (English) Zbl 0402.05042 J. Comb. Theory, Ser. A 24, 296-307 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 207 Documents MSC: 05C30 Enumeration in graph theory 05A15 Exact enumeration problems, generating functions Keywords:Asymptotic Number of Labeled Graphs; Given Degree Sequences; Integer Matrices; Incidence Matrices; Inclusion-Exclusion Citations:Zbl 0277.05002 PDFBibTeX XMLCite \textit{E. A. Bender} and \textit{E. R. Canfield}, J. Comb. Theory, Ser. A 24, 296--307 (1978; Zbl 0402.05042) 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.