| Article ID: | iaor19911667 |
| Country: | Netherlands |
| Volume: | 30 |
| Issue: | 2/3 |
| Start Page Number: | 221 |
| End Page Number: | 227 |
| Publication Date: | Feb 1991 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Miller Zevi, McDairmid Colin |
The bandwidth of a random graph has been well studied. A natural generalization of bandwidth involves replacing the path as host graph by a multi-dimensional lattice. In this paper the authors investigate the corresponding behavior for random graphs.