✦ LIBER ✦

Enumeration of Unlabelled Mating Graphs

✍ Scribed by Goran Kilibarda

Book ID: 106047637
Publisher: Springer Japan
Year: 2007
Tongue: English
Weight: 309 KB
Volume: 23
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-007-0692-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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.

Two problems in the enumeration of unlab

Two problems in the enumeration of unlabelled graphs

✍ E.M. Wright 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 285 KB

The Evolution of Unlabelled Graphs

✍ Wright, E. M. 📂 Article 📅 1976 🏛 Oxford University Press 🌐 English ⚖ 124 KB

The k-Connectedness of Unlabelled Graphs

✍ Walsh, T. R. S.; Wright, E. M. 📂 Article 📅 1978 🏛 Oxford University Press 🌐 English ⚖ 144 KB

The Asymptotic Number of Unlabelled Regu

The Asymptotic Number of Unlabelled Regular Graphs

✍ Bollobas, B. 📂 Article 📅 1982 🏛 Oxford University Press 🌐 English ⚖ 128 KB