Title

An Extremal Bandwidth Problem For Bipartite Graphs

Keywords

Bandwidth; Bipartite; Edges; Extremal

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.

Publication Date

1-1-2000

Publication Title

Journal of Graph Theory

Volume

35

Issue

4

Number of Pages

278-289

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1002/1097-0118(200012)35:4<278::AID-JGT5>3.0.CO;2-U

Socpus ID

0042689503 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0042689503

This document is currently not available here.

Share

COinS