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

DOI10.1155/2020/8367408zbMath1489.05040OpenAlexW3047015237MaRDI QIDQ827214

Blessings T. Fundikwa, Simon Mukwembi, Jaya Percival Mazorodze

Publication date: 7 January 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/8367408

Mathematics Subject Classification ID

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

Related Items (1)

Diameter, edge-connectivity, and \(C_4\)-freeness

Cites Work

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

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