|
|||||
|
|
An extremal bandwidth problem for bipartite graphs |
|
| Authors: | Robert C. Brigham Julie R. Carrington Ronald D. Dutton Joseph Fiedler Richard P. Vitray |
| 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. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 278–289, 2000 |
| Keywords: | bandwidth bipartite extremal edges |