Abstract
The bandwidths of labeled, rooted trees are studied. It is shown that the average bandwidth of trees of n vertices is >C1 n and <C2 n log n. The width of such a tree is the largest number of vertices at a constant distance from the root. The distribution of the width and its relationship with the bandwidth are studied. Results include generating functions for trees by width, and asymptotic estimates.
Original language | English (US) |
---|---|
Pages (from-to) | 348-370 |
Number of pages | 23 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 42 |
Issue number | 3 |
DOIs | |
State | Published - Jun 1987 |