An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph
Summary: We show that if \(G\) is a 3-vertex-connected \(C_4\)-free graph of order \(n\) and radius \(r\), then the inequality \(r\leq(2n/9)+O(1)\) holds. Moreover, graphs are constructed to show that the bounds are asymptotically sharp.
scientific article; zbMATH DE number 7290905