The number of edges in a bipartite graph of given radius

作者：Dankelmann P; Swart Henda C^*; van den Berg P

来源：Discrete Mathematics, 2011, 311(8-9): 690-698.

DOI：10.1016/j.disc.2011.01.015

• Bipartite graph
• Radius
• Edges

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.

• 出版日期2011-5-6