Radius of \((2k-1)\)-Connected Graphs

Yoshimi Egawa1, Katsumi Inoue1
1Department of Applied Mathematics Science University of Tokyo 1-3 Kagurazaka Shinjuku-ku, Tokyo 162 Japan

Abstract

We show that if \(G\) is a \((2k-1)\)-connected graph \((k \geq 2)\) with radius \(r\), then \(r \leq \left\lfloor \frac{|V(G)|+2k+9}{2k}\right\rfloor\).