树的圈上带宽和下界

Lower Bounds of Cyclic Bandwidth Sum for Trees

给出了一些以顶点数、直径或独立数表示的树的圈上带宽和的下界，并以此计算了K1，n(星）和Wn+1（轮）的圈上带宽和。

We obtain some lower bounds of cyclic bandwidth sum for trees with their vertex numbers and diameters or independence numbers.We also calculate cyclic bandwidth sum of K_(1,n)(star) and W_(n+1)(wheel)by using the lower bounds.