摘要
B(G) denotes the bandwidth of graph G. For tree T, Ve(T)={v|v∈V(T) and dT(v)=1}. In this paper, we discuss bandwidths of trees and obtain that for any tree T,B(T)and the bounds is sharp. For two extreme cases, a tree with a minimal number of internal vertices or one with a maximal number of internal vertices, that is, a star or a path, the equality holds.This bounds is much better than the previous one, B(G) .
B(G) denotes the bandwidth of graph G. For tree T, Ve(T)={v|v∈V(T) and dT(v)=1}. In this paper, we discuss bandwidths of trees and obtain that for any tree T,B(T)and the bounds is sharp. For two extreme cases, a tree with a minimal number of internal vertices or one with a maximal number of internal vertices, that is, a star or a path, the equality holds.This bounds is much better than the previous one, B(G) .
