| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437049 | Theoretical Computer Science | 2006 | 15 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
