The following pages link to (Q5461702):
Displayed 12 items.
- Minimum degree, edge-connectivity and radius (Q385477) (← links)
- The number of edges in a bipartite graph of given radius (Q533777) (← links)
- An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph (Q821263) (← links)
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph (Q828980) (← links)
- Minimum size of a graph or digraph of given radius (Q989544) (← links)
- Diameter of 4-colourable graphs (Q1024307) (← links)
- The radius of \(k\)-connected planar graphs with bounded faces (Q1759405) (← links)
- Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity (Q2223416) (← links)
- Distances in graphs of girth 6 and generalised cages (Q2656962) (← links)
- On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs (Q2689649) (← links)
- Wiener index in graphs with given minimum degree and maximum degree (Q5038190) (← links)
- Radius, leaf number, connected domination number and minimum degree (Q6110370) (← links)