On bandwidth and cyclic bandwidth of graphs

Let B(G) and B-c(G) denote the bandwidth and cyclic bandwidth of graph G. respectively. In this paper, we shall give a sufficient condition for graphs to have equal bandwidth and cyclic bandwidth. This condition is satisfied by trees. Thus all theorems on bandwidth of graphs apply to cyclic bandwidth of graphs satisfying the sufficiency condition, and in particular, to trees. We shall also give a lower bound of B-c(G) in terms of B(G).