On the edge-bandwidth of graph products

The edge-bandwidth of a graph G is the bandwidth of the line graph of G. We show asymptotically tight bounds on the edge-bandwidth of two-dimensional grids and tori, the product of two cliques and the n-dimensional hypercube.