Bandwidth versus Bandsize

P. Erdős, P. Hell, P. Winkler

Research output: Article

4 Citations (Scopus)

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 cn1-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 - C1 log n and the latter at least n -c2 (logn)2.

Original languageEnglish
Pages (from-to)117-129
Number of pages13
JournalAnnals of Discrete Mathematics
Volume41
Issue numberC
DOIs
Publication statusPublished - 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