An Upper Bound On The Radius Of A 3-Vertex-Connectedc4-Free Graph

We show that if G is a 3-vertex-connected C-4-free graph of order n and radius r, then the inequality r <= (2n/9) + O(1) holds. Moreover, graphs are constructed to show that the bounds are asymptotically sharp.