An upper bound on the radius of a 3-edge-connected graph

MaRDI QIDQ5442174zbMATH OpenFDO

Authors Peter Dankelmann, Simon Mukwembi, H. C. Swart

Publication date 22 February 2008

zbMATH Keywords

edge-connectivityradius of a graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 1136037
• Minimum degree, edge-connectivity and radius
• An upper bound for the radius of a 3-connected graph
• An upper bound on the radius of a 3-vertex-connected C₄-free graph
• scientific article; zbMATH DE number 5543113

Cited in

(12)

• An upper bound for the radius of a 3-connected graph
• Upper bound on the third edge-connectivity of graphs
• Distances in graphs of girth 6 and generalised cages
• scientific article; zbMATH DE number 5543113 (Why is no real title available?)
• Minimum degree, edge-connectivity and radius
• scientific article; zbMATH DE number 1136037 (Why is no real title available?)
• The number of edges in a bipartite graph of given radius
• The k-radius of 2-connected graphs
• 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₄-free graph
• An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
• Minimum size of a graph or digraph of given radius

This page was built for publication: An upper bound on the radius of a 3-edge-connected graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5442174)