𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree

✍ Scribed by Shinsei Tazawa; Teruhiro Shirakura; Saburo Tamura

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
609 KB
Volume
90
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Tazawa,

S., T. Shirakura and S. Tamura, Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree, Discrete Mathematics 90 (1991) 63-74.

In a digraph, a vertex of odd out(in)-degree is called an odd out(in)-vertex. This paper will give the ordinary generating functions for labelled digraphs and unlabelled strict digraphs with given numbers of odd out-vertices and odd in-vertices.

πŸ“œ SIMILAR VOLUMES

Graphs with given odd sets and the least
Graphs with given odd sets and the least number of vertices
✍ Louis Hakimi, S. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and SoltΓ©s: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.

Vertices of given degree in a random gra
Vertices of given degree in a random graph
✍ BΓ©la BollobΓ‘s πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 349 KB πŸ‘ 1 views
On the number of vertices of given degre
On the number of vertices of given degree in a random graph
✍ Zbigniew Palka πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 115 KB πŸ‘ 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

The number of cut-vertices in a graph of
The number of cut-vertices in a graph of given minimum degree
✍ Michael O. Albertson; David M. Berman πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in

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.