Minimum size of a graph or digraph of given radius

DOI10.1016/j.ipl.2009.06.001zbMath1197.05076OpenAlexW2005549991MaRDI QIDQ989544

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

zbMATH Keywords

graphdigraphsizeinterconnection networksminimum degreeradius

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items

Distances in graphs of girth 6 and generalised cages ⋮ The weight function lemma for graph pebbling ⋮ On size, order, diameter and minimum degree ⋮ Minimum degree, edge-connectivity and radius ⋮ Maximum size of digraphs of given radius ⋮ On size, order, diameter and edge-connectivity of graphs

Uses Software

• GRAFFITI

Cites Work

• The number of edges in a bipartite graph of given radius
• Maximum induced trees in graphs
• On the radius of graphs
• Radius, diameter, and minimum degree
• An upper bound for the radius of a 3-connected graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item