Edge-bandwidth of graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
12 pages

Keywords

Combinatorics, 05C78, 05C35

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/78318

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9904011
 http://arxiv.org/abs/math/9904011

Collections

arXiv