The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\)
The bandwidth of a graph \(G = (V,E)\) is the minimum over all bijective functions \(f : B \to \{1, 2, \dots, |V |\}\), of \(\max \{|f(v) - f(w) |: \{v,w\} \in E\}\). This paper shows that a tree with \(k\) leaves has bandwidth at most \(\lceil k/2 \rceil\).
scientific article; zbMATH DE number 896017
scientific article