Edge-bandwidth of graphs

Simple item page
dc.creatorJiang, Tao
dc.creatorMubayi, Dhruv
dc.creatorShastri, Aditya
dc.creatorWest, Douglas B.
dc.date1999-04-03
dc.date.accessioned2026-07-07T05:28:36Z
dc.date.available2026-07-07T05:28:36Z
dc.descriptionThe 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.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/9904011
dc.identifierhttp://arxiv.org/abs/math/9904011
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78318
dc.subjectCombinatorics
dc.subject05C78, 05C35
dc.titleEdge-bandwidth of graphs
dc.typetext

Files

Collections

arXiv