Bandwidth of the complete \(k\)-ary tree
The author succeeds in determining the bandwidth \(B(T_{k,d})\) of the complete \(k\)-ary tree \(T_{k,d}\) on \(d\) levels, \(k,d\in \mathbb{N}\). The proof is constructive and done by rectifying a known algorithm of Chung (1988).
scientific article; zbMATH DE number 790761