๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Wiener indices of balanced binary trees

โœ Scribed by Sergey Bereg; Hao Wang

Book ID
108112623
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
252 KB
Volume
155
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Randomly balanced binary trees
Randomly balanced binary trees
โœ R. Sprugnoli ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Springer Milan ๐ŸŒ English โš– 870 KB
Onk-Dimensional Balanced Binary Trees
Onk-Dimensional Balanced Binary Trees
โœ Vijay K. Vaishnavi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 510 KB
On rotations in fringe-balanced binary t
On rotations in fringe-balanced binary trees
โœ Hosam M. Mahmoud ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 451 KB

We employ a P6lya urn to model rotations in a random fringe-balanced binary search tree. We show that asymptotically the number of rotations to construct a tree of size n has a normal distribution with mean +n and variance sn. Exact results for mean and variance are developed in the process. @ 1998

Wiener indices of trees and monocyclic g
Wiener indices of trees and monocyclic graphs with given bipartition
โœ Zhibin Du ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 155 KB

## Abstract The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. It has found various applications in chemical research. We determine the minimum and the maximum Wiener indices of trees with given bipartition and the minimum Wiener in