Bandwidth and density for block graphs

Details Bandwidth and density for block graphs Bandwidth and density for block graphs

1998-02-05

arxiv.org/abs/math/9802025v1

Discrete Mathematics 189(1998), 163-176

Mathematics

Combinatorics

14 pages, 9 included figures. Note: figures did not appear in original upload; resubmission corrects this

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bandwidth and density for block graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bandwidth and density for block graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bandwidth and density for block graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-253243