Document Type
Article
Publication Date
7-6-2012
Abstract
For a graph G, let γ:V(G)→1,⋯,|V(G)| be a one-to-one function. The bandwidth of γ is the maximum of |γ(u)-γ(v)| over uv∈E(G). The bandwidth of G, denoted b(G), is the minimum bandwidth over all embeddings γ, b(G)=min γmax|γ(u)-γ(v) |:uv∈E(G). In this paper, we show that the bandwidth computation problem for trees of diameter at most 4 can be solved in polynomial time. This naturally complements the result computing the bandwidth for 2-caterpillars. © 2012 Elsevier B.V. All rights reserved.
Publication Source (Journal or Book title)
Discrete Mathematics
First Page
1947
Last Page
1951
Recommended Citation
Bilinski, M., Choi, K., Chun, D., Ding, G., Dziobiak, S., Farnham, R., Iverson, P., Leu, S., & Lowrance, L. (2012). Bandwidth of trees of diameter at most 4. Discrete Mathematics, 312 (12-13), 1947-1951. https://doi.org/10.1016/j.disc.2012.03.006