Diameter and inverse degree Original Research Article

The inverse degree image of a finite graph image is defined as image. We prove that, if G is connected and of order n, then the diameter of G is less than image. This improves a bound given by Erdös et al. by a factor of approximately 2.