On number of leaves and bandwidth of trees

Let B(G) denote the bandwidth of graph G. For any tree T, Ve(T) denote the set of leaves (vertices of degree 1) of T. Wang and Yao[5] obtained that for any tree T, B(T)≤⌈∥Ve(T)∥/2] and the bound is sharp. In this paper, we show that any tree may be imbedded into another tree with the same number of leaves, and for this latter tree, the bound in the above inequality is reached. In other words, the bound is reached in almost all trees. We also describe trees Sr,d, where d and r are integers and ∥Ve(Sr,d)∥=(d+1)×dr_1. Moreover, we will show that if d (≤2r) is large, the ratio of the bandwidth to the number of leaves of Sr,d will be very small.