On the radius of graphs

DOI10.1016/0095-8956(81)90101-5zbMath0483.05039OpenAlexW2072220480MaRDI QIDQ1163031

Hansjoachim Walther, Jochen Harant

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90101-5

zbMATH Keywords

radius3-connected graph

Mathematics Subject Classification ID

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

Related Items (8)

An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph ⋮ An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph ⋮ An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ On smallest 3-polytopes of given graph radius ⋮ The radius of \(k\)-connected planar graphs with bounded faces ⋮ Minimum size of a graph or digraph of given radius ⋮ Average distance and vertex-connectivity ⋮ An upper bound for the radius of a 3-connected graph

Cites Work

• On the depth of a planar graph
• Parallel concepts in graph theory
• Unnamed Item

This page was built for publication: On the radius of graphs