A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Abstract

This article provides a survey of results on the exact bandwidth, edgesum, and profile of graphs. A bibliography of work in these areas is provided. The emphasis is on composite graphs. This may be regarded as an update of the original survey of solved bandwidth problems by Chinn, Chvátalová, Dewdney, and Gibbs [10] in 1982. Also several of the application areas involving these graph parameters are described. © John & Sons, Inc. Graph Theory 31: 75–94, 1999