✦ LIBER ✦

Enumeration of unlabelled bicolored graphs by degree parities

✍ Scribed by Shinsei Tazawa; Teruhiro Shirakura

Book ID: 104340255
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 515 KB
Volume: 58
Category: Article
ISSN: 0378-3758
DOI: 10.1016/s0378-3758(96)00070-5

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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 Mating Graphs

✍ Goran Kilibarda 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 309 KB

Enumeration of labelled multigraphs by d

Enumeration of labelled multigraphs by degree parities

✍ R.C. Read; R.W. Robinson 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 662 KB

Counting formulae are obtained for the numbers of Itbelled (p,q)-multigraphs with any even number n of points of odd degree and p-n points of even degree. Similar results are obtained for multigraphs of strength s, and in this case for the sum over the ntimber q of lines. These sums are much less si

Enumeration of graphs by degree sequence

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

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

Asymptotic enumeration of labeled multig

Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities

✍ Edward A. Bender; L. Bruce Richmond 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

We show that the number of labeled (n, q)-multigraphs with some specified p vertices of odd degree is asymptotically independent of p and is in fact asymptotically 2'-" times the number of (n, q)-multigraphs. We determine the asymptotic number of (n, q)-multigraphs.