On the radius of graphs

Let G be any 3-connected graph containing n vertices and r the radius of G. Then the inequality $\text{r <}\text{1}\text{4}\text{n + O(}\text{log}\text{n)}$ is proved. A similar theorem concerning any (2m ?1)-connected graph G can be proved too.