Edge-Bandwidth of Graphs

Authors:
Tao Jiang;Dhruv Mubayi;Aditya Shastri;Douglas B. West
Affiliations:
-;-;-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
1999

Citing 0
Cited 4

Orthogonal 3D Shapes of Theta Graphs

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
New results on edge-bandwidth

Theoretical Computer Science - Selected papers in honor of Lawrence Harper
On the edge-bandwidth of graph products

Theoretical Computer Science
Edge-bandwidth of grids and tori

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 Kn, Kn,n, caterpillars, and some theta graphs.