𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumeration of labelled multigraphs by degree parities

✍ Scribed by R.C. Read; R.W. Robinson

Book ID
103057623
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
662 KB
Volume
42
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 simple if s is even than if s is odd. However, it is shown that for s fixed, and p + 0, the asymptotic value does not depend on the parity of s.

πŸ“œ SIMILAR VOLUMES

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.

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.