Let $G$ be a finite connected graph. We give an asymptotically tight upper bound on the size of $G$ in terms of order, radius and minimum degree. Our result is a strengthening of an old classical theorem of Vizing (1967) if minimum degree is prescribed.