### Abstract

The bandwidth (bandsize) of a graph G is the minimum, over all bijections u: V(G) → {1,2,...,|V(G)|}, of the greatest difference (respectively the number of distinct differences) |u(v)-u(w)| for vw e{open}E(G). We show that a graph on n vertices with bandsize k has bandwidth between k and cn^{1-1/n}, and that this is best possible. In the process we obtain best possible asymptotic bounds on the bandwidth of circulant graphs. The bandwidth and bandsize of random graphs are also compared, the former turning out to be n - C_{1} log n and the latter at least n -c_{2} (logn)^{2}.

Original language | English |
---|---|

Pages (from-to) | 117-129 |

Number of pages | 13 |

Journal | Annals of Discrete Mathematics |

Volume | 41 |

Issue number | C |

DOIs | |

Publication status | Published - 1988 |

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Bandwidth versus Bandsize'. Together they form a unique fingerprint.

## Cite this

Erdős, P., Hell, P., & Winkler, P. (1988). Bandwidth versus Bandsize.

*Annals of Discrete Mathematics*,*41*(C), 117-129. https://doi.org/10.1016/S0167-5060(08)70455-2