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

zbMATH Open1138.05017MaRDI QIDQ5442174FDOQ5442174

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

Publication date: 22 February 2008

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_4\)-free graph
• scientific article

zbMATH Keywords

edge-connectivityradius of a graph

Mathematics Subject Classification ID

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

Cited In (10)

• 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
• Minimum size of a graph or digraph of given radius
• An upper bound for the radius of a 3-connected graph
• The number of edges in a bipartite graph of given radius
• Distances in graphs of girth 6 and generalised cages
• Upper bound on the third edge-connectivity of graphs
• Minimum degree, edge-connectivity and radius
• Title not available (Why is that?)

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)