𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Limit distributions of the number of vertices of a given out-degree in a random forest

✍ Scribed by T. Mylläri; Yu. Pavlov

Publisher
Springer US
Year
2006
Tongue
English
Weight
149 KB
Volume
138
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Enumeration of digraphs with given numbe
Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
✍ Shinsei Tazawa; Teruhiro Shirakura; Saburo Tamura 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 609 KB

## 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 g

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

The distribution of nodes of given degre
The distribution of nodes of given degree in random trees
✍ Drmota, Michael; Gittenberger, Bernhard 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 391 KB 👁 2 views

Let T n denote the set of unrooted unlabeled trees of size n and let k ≥ 1 be given. By assuming that every tree of T n is equally likely, it is shown that the limiting distribution of the number of nodes of degree k is normal with mean value ∼ µ k n and variance ∼ σ 2 k n with positive constants µ