Edge-bandwidth of graphs

Details Edge-bandwidth of graphs Edge-bandwidth of graphs

1999-04-03

arxiv.org/abs/math/9904011v1

Mathematics

Combinatorics

12 pages

Scientific paper

The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every graph, with equality for certain caterpillars. We obtain sharp or nearly-sharp bounds on the change in edge-bandwidth under addition, subdivision, or contraction of edges. We compute edge-bandwidth for cliques, bicliques, caterpillars, and some theta graphs.

Affiliated with

Also associated with

No associations

Rating

Edge-bandwidth of 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 Edge-bandwidth of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge-bandwidth of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-316813