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

Bandwidths and profiles of trees

โœ Scribed by Andrew M Odlyzko; Herbert S Wilf

Book ID
103506993
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
982 KB
Volume
42
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On upper bounds of bandwidths of trees
On upper bounds of bandwidths of trees
โœ Jianfang Wang; Bing Yao ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 349 KB
On number of leaves and bandwidth of tre
On number of leaves and bandwidth of trees
โœ Peter C. B. Lam ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 249 KB
Wind profiles in and over trees
Wind profiles in and over trees
โœ Zhu Jiao-jun; LI Xiu-fen; Gonda Yutaka; Matsuzaki Takeshi ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer ๐ŸŒ English โš– 738 KB
Bandwidth of the complete k-ary tree
Bandwidth of the complete k-ary tree
โœ Lawren Smithline ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 524 KB

We determine, constructively, the bandwidth of the complete k-ary tree on d levels. By rectifying an algorithm of Chung (1988), we establish B( Tk,J = rk(kd -1)/(2d( k -1)) 1. ## 1. Praeludium The bandwidth problem for a graph G is a question about numbering the vertices of G so the maximum differ