An extremal bandwidth problem for bipartite graphs

Authors

Authors

R. C. Brigham; J. R. Carrington; R. D. Dutton; J. Fiedler;R. P. Vitray

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

J. Graph Theory

Keywords

bandwidth; bipartite; extremal; edges; Mathematics

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.

Journal Title

Journal of Graph Theory

Volume

35

Issue/Number

4

Publication Date

1-1-2000

Document Type

Article

DOI Link

http://dx.doi.org/10.1002/1097-0118(200012)35:4<278::aid-jgt5>3.0.co;2-u

Language

English

First Page

278

Last Page

289

WOS Identifier

WOS:000165091700005

ISSN

0364-9024

Recommended Citation

"An extremal bandwidth problem for bipartite graphs" (2000). Faculty Bibliography 2000s. 2445.
https://stars.library.ucf.edu/facultybib2000/2445