Bandwidth of the complete k-ary tree Original Research Article
Author/Authors :
Lawren Smithline، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1995
Pages :
10
From page :
203
To page :
212
Abstract :
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,d) = [k(kd - 1)/(2d(k - 1)).
