| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648539 | Discrete Mathematics | 2011 | 9 Pages |
Abstract
Vizing established an upper bound on the size of a graph of given order and radius. We find a sharp upper bound on the size of a bipartite graph of given order and radius.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
P. Dankelmann, Henda C. Swart, P. van den Berg,