1999/04/03 by Tao Jiang, Dhruv Mubayi, Jiang, Tao +5
Computer Science · Mathematics · #05C35 #05C78 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #math.CO #msc:05C35 #msc:05C78
paper · pdf · doi:10.48550/arxiv.math/9904011
12 pages
arxiv created 1999/04/03 · openalex publication_date 1999/04/03 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.