Premium
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
Author(s) -
Lai YungLing,
Williams Kenneth
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199906)31:2<75::aid-jgt1>3.0.co;2-s
Subject(s) - bandwidth (computing) , mathematics , graph , bibliography , combinatorics , graph theory , chordal graph , discrete mathematics , computer science , telecommunications , library science
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