Minimum size of a graph or digraph of given radius
From MaRDI portal
Publication:989544
DOI10.1016/J.IPL.2009.06.001zbMATH Open1197.05076OpenAlexW2005549991MaRDI QIDQ989544FDOQ989544
Authors: Peter Dankelmann, Lutz Volkmann 
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.06.001
Recommendations
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Distance in graphs (05C12)
Cites Work
- Radius, diameter, and minimum degree
- Maximum induced trees in graphs
- An upper bound on the radius of a 3-edge-connected graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- An upper bound for the radius of a 3-connected graph
- Title not available (Why is that?)
- The number of edges in a bipartite graph of given radius
- Radius of \((2k-1)\)-connected graphs
- Title not available (Why is that?)
- On the radius of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- On size, order, diameter and edge-connectivity of graphs
- The weight function lemma for graph pebbling
- Radius, diameter, and minimum degree
- On size, radius and minimum degree
- Distances in graphs of girth 6 and generalised cages
- Maximum size of digraphs of given radius
- On size, order, diameter and minimum degree
- Minimum degree, edge-connectivity and radius
Uses Software
This page was built for publication: Minimum size of a graph or digraph of given radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989544)
