The number of edges in a bipartite graph of given radius

DOI10.1016/j.disc.2011.01.015zbMath1222.05129OpenAlexW2015026374MaRDI QIDQ533777

Peter Dankelmann, Henda C. Swart, Paul van den Berg

Publication date: 6 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.01.015

zbMATH Keywords

edgesbipartite graphradius

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (5)

Distances in graphs of girth 6 and generalised cages ⋮ Maximum size of digraphs of given radius ⋮ Distance and size in digraphs ⋮ The radius of \(k\)-connected planar graphs with bounded faces ⋮ Minimum size of a graph or digraph of given radius

Cites Work

• Radius, diameter, and minimum degree
• A characterization of radius-critical graphs
• Anticritical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of edges in a bipartite graph of given radius