Bandwidth and density for block graphs
Combinatorics
2007-05-23 v1
Abstract
The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when the vertices have distinct integer labels. We provide a polynomial algorithm to produce an optimal bandwidth labeling for graphs in a special class of block graphs (graphs in which every block is a clique), namely those where deleting the vertices of degree one produces a path of cliques. The result is best possible in various ways. Furthermore, for two classes of graphs that are ``almost'' caterpillars, the bandwidth problem is NP-complete.
Keywords
Cite
@article{arxiv.math/9802025,
title = {Bandwidth and density for block graphs},
author = {Le Tu Quoc Hung and Maciej M. Syslo and Margaret L. Weaver and Douglas B. West},
journal= {arXiv preprint arXiv:math/9802025},
year = {2007}
}
Comments
14 pages, 9 included figures. Note: figures did not appear in original upload; resubmission corrects this