✦ LIBER ✦

On the Number of t-Ary Trees with a Given Path Length

✍ Scribed by Gadiel Seroussi

Publisher: Springer
Year: 2006
Tongue: English
Weight: 190 KB
Volume: 46
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-006-0122-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the expected path length of tr

A note on the expected path length of trees with known fringe

✍ Roberto De Prisco; Giuseppe Parlati; Giuseppe Persiano 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 480 KB

The tree number of a graph with a given

The tree number of a graph with a given girth

✍ M. Truszczyński 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 796 KB

On Pairs of Lattice Paths with a Given N

On Pairs of Lattice Paths with a Given Number of Intersections

✍ Markus Fulmek 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 307 KB

This formula was proved in [2] by means of generating functions. ## 2. INTERPRETATION OF THE FORMULA'S SUMMANDS Our bijection is based on an appropriate lattice-path-interpretation for the formula's summands (pointed out by Krattenthaler [4]): Clearly, we article no. TA962754 154 0097-3165Â97 25.0

On the joint distribution of the inserti

On the joint distribution of the insertion path length and the number of comparisons in search trees

✍ Hosam M. Mahmoud; Boris Pittel 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 786 KB

Asymptotic formulas for the enumerator o

Asymptotic formulas for the enumerator of trees with a given number of hanging or internal vertices

✍ V. A. Voblyi 📂 Article 📅 1977 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 213 KB

On the spectral radius of graphs with a

On the spectral radius of graphs with a given domination number

✍ Dragan Stevanović; Mustapha Aouchiche; Pierre Hansen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 202 KB