Title of article
The number of edges in a bipartite graph of given radius
Author/Authors
Dankelmann، نويسنده , , P. and Swart، نويسنده , , Henda C. and van den Berg، نويسنده , , P.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
9
From page
690
To page
698
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
Edges , bipartite graph , Radius
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1598394
Link To Document