An extremal bandwidth problem for bipartite graphs

Authors
Brigham, RC Carrington, JR Dutton, RD Fiedler, J Vitray, RP
Citation
Rc. Brigham et al., An extremal bandwidth problem for bipartite graphs, J GRAPH TH, 35(4), 2000, pp. 278-289
Citations number
5
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024 → ACNP
Volume
35
Issue
4
Year of publication
2000
Pages
278 - 289
Database
ISI
SICI code
0364-9024(200012)35:4<278:AEBPFB>2.0.ZU;2-G
Abstract
This paper discusses the problem of finding the maximum number of edges E(m ,n,B) in a bipartite graph having partite set sizes m and n and bandwidth B . Exact values for E(m,n,B) are found for many cases. (C) 2000 John Wiley & Sons, Inc.