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

DOI10.1007/S13370-020-00837-7MaRDI QIDQ821263zbMATH OpenOpenAlexFDO

Authors Blessings T. Fundikwa, Simon Mukwembi, J. P. Mazorodze

Publication date 20 September 2021

Published in Afrika Matematika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13370-020-00837-7

zbMATH Keywords

radiusedge-connectivity

Mathematics Subject Classification ID

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

Recommendations

• 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
• scientific article; zbMATH DE number 5543113
• An upper bound for the radius of a 3-connected graph
• Order and radius of 3-connected graphs

Cites work

• scientific article; zbMATH DE number 5543113 (Why is no real title available?)
• scientific article; zbMATH DE number 2188620 (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
• On the radius of graphs
• Radius of \((2k-1)\)-connected graphs
• Radius, diameter, and minimum degree
• Stability, domination and irredundance in a graph

Cited in

(5)

• scientific article; zbMATH DE number 5543113 (Why is no real title available?)
• An upper bound on the radius of a 3-vertex-connected C₄-free graph
• scientific article; zbMATH DE number 4185644 (Why is no real title available?)
• An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
• Diameter, edge-connectivity, and \(C_4\)-freeness

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

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