The number of edges in a bipartite graph of given radius

P. Dankelmann; Henda C. Swart; P. Van Den Berg

doi:10.1016/j.disc.2011.01.015

The number of edges in a bipartite graph of given radius

P. Dankelmann, Henda C. Swart, P. Van Den Berg

University of KwaZulu-Natal

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

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.

Original language	English
Pages (from-to)	690-698
Number of pages	9
Journal	Discrete Mathematics
Volume	311
Issue number	8-9
DOIs	https://doi.org/10.1016/j.disc.2011.01.015
Publication status	Published - 6 May 2011
Externally published	Yes

Keywords

Bipartite graph
Edges
Radius

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2011.01.015

Cite this

@article{e5becf55f6824eb28d7f6ca65c741b48,

title = "The number of edges in a bipartite graph of given radius",

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 = "Bipartite graph, Edges, Radius",

author = "P. Dankelmann and Swart, {Henda C.} and {Van Den Berg}, P.",

year = "2011",

month = may,

day = "6",

doi = "10.1016/j.disc.2011.01.015",

language = "English",

volume = "311",

pages = "690--698",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "8-9",

}

TY - JOUR

T1 - The number of edges in a bipartite graph of given radius

AU - Dankelmann, P.

AU - Swart, Henda C.

AU - Van Den Berg, P.

PY - 2011/5/6

Y1 - 2011/5/6

N2 - 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.

AB - 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.

KW - Bipartite graph

KW - Edges

KW - Radius

UR - http://www.scopus.com/inward/record.url?scp=79551602709&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2011.01.015

DO - 10.1016/j.disc.2011.01.015

M3 - Article

AN - SCOPUS:79551602709

SN - 0012-365X

VL - 311

SP - 690

EP - 698

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 8-9

ER -

The number of edges in a bipartite graph of given radius

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this