Edge-bandwidth of grids and tori

https://doi.org/10.1016/j.tcs.2006.06.018Get rights and content
Under an Elsevier user license
open archive

Abstract

The edge-bandwidth of a graph G is the smallest number B for which there is a bijective labeling of E(G) with {1,,e(G)} such that the difference between the labels at any adjacent edges is at most B. Here we compute the edge-bandwidth for rectangular grids:B(PmPn)=2min(m,n)-1ifmax(m,n)3,where is the Cartesian product and Pn denotes the path on n vertices. This settles a conjecture of Calamoneri et al. [New results on edge-bandwidth, Theoret. Comput. Sci. 307 (2003) 503–513]. We also compute the edge-bandwidth of any torus (a product of two cycles) within an additive error of 5.

Keywords

Edge bandwidth
Graph products
Grids

Cited by (0)

1

Partially supported by NSF Grant DMS-0457512.