✦ LIBER ✦

Asymptotic Enumeration by Degree Sequence of Graphs of High Degree

✍ Scribed by McKay, Brendan D.; Wormald, Nicholas C.

Book ID: 123057532
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 878 KB
Volume: 11
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(13)80042-X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of graphs by degree sequence

✍ Phil Hanlon 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

Asymptotic enumeration by degree sequenc

Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2)

✍ Brendan D. McKay; Nicholas C. Wormald 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 640 KB

Enumeration of unlabelled bicolored grap

Enumeration of unlabelled bicolored graphs by degree parities

✍ Shinsei Tazawa; Teruhiro Shirakura 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 515 KB

This paper gives an ordinary generating function for unlabelled bicolored graphs with a given number of odd vertices, where the cardinalities of the bipartite sets are equal. Moreover, the generating functions for the cardinality of each bipartite set from 1 to 8 are listed.

The asymptotic number of labeled graphs

The asymptotic number of labeled graphs with given degree sequences

✍ Edward A Bender; E.Rodney Canfield 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 470 KB

Enumeration of unlabelled graphs with sp

Enumeration of unlabelled graphs with specified degree parities

✍ Chiê Nara; Shinsei Tazawa 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Degree Sequences of Infinite Graphs

✍ Blass, A.; Harary, F. 📂 Article 📅 1981 🏛 Oxford University Press 🌐 English ⚖ 161 KB