✦ LIBER ✦

The outer-distance of nodes in random trees

✍ Scribed by A. Meir; J. W. Moon

Publisher: Springer
Year: 1981
Tongue: English
Weight: 325 KB
Volume: 23
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf02188033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the altitude of specified nodes in ra

On the altitude of specified nodes in random trees

✍ Helmut Prodinger 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

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 µ

Distances in random digital search trees

✍ Rafik Aguech; Nabil Lasmar; Hosam Mahmoud 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 274 KB

The expected node-independence number of

The expected node-independence number of random trees

✍ A Meir; J.W Moon 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 289 KB

Note on the outdegree of a node in rando

Note on the outdegree of a node in random recursive trees

✍ Mehri Javanian; Mohammad Q. Vahidi-Asl 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 115 KB

A distinct distance set of 9 nodes in a

A distinct distance set of 9 nodes in a tree of diameter 36

✍ Herbert Taylor 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Taylor, H., A distinct distance set of 9 nodes in a tree of diameter 36, Discrete Mathematics 93 (1991) 167-168.