Minimum size of a graph or digraph of given radius
From MaRDI portal
(Redirected from Publication:989544)
Recommendations
Cites work
- scientific article; zbMATH DE number 5543113 (Why is no real title available?)
- scientific article; zbMATH DE number 4041962 (Why is no real title available?)
- scientific article; zbMATH DE number 2188620 (Why is no real title available?)
- scientific article; zbMATH DE number 3227798 (Why is no real title available?)
- scientific article; zbMATH DE number 3255492 (Why is no real title available?)
- scientific article; zbMATH DE number 3340118 (Why is no real title available?)
- An upper bound for the radius of a 3-connected graph
- An upper bound on the radius of a 3-edge-connected graph
- Maximum induced trees in graphs
- On the radius of graphs
- Radius of \((2k-1)\)-connected graphs
- Radius, diameter, and minimum degree
- The number of edges in a bipartite graph of given radius
Cited in
(8)- The weight function lemma for graph pebbling
- Maximum size of digraphs of given radius
- On size, radius and minimum degree
- On size, order, diameter and edge-connectivity of graphs
- On size, order, diameter and minimum degree
- Minimum degree, edge-connectivity and radius
- Distances in graphs of girth 6 and generalised cages
- Radius, diameter, and minimum degree
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)