An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph

DOI10.1007/s13370-020-00837-7zbMath1488.05156OpenAlexW3090198361MaRDI QIDQ821263

Simon Mukwembi, Blessings T. Fundikwa, Jaya Percival 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)

Cites Work

• On the radius of graphs
• Radius, diameter, and minimum degree
• An upper bound for the radius of a 3-connected graph
• Stability, domination and irredundance in a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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