A Lower Bound on the Number of Vertices of a Graph

V. G. Kane, S. P. Mohanty
1978 Proceedings of the American Mathematical Society  
In this note, we derive a lower bound for the number of vertices of a graph in terms of its diameter, d, connectivity zc and minimum degree p which is sharper than that of Watkins [1] by an amount 2(p -k).
doi:10.2307/2042566 fatcat:wpfscqqy4jcrlji2ocwkbd3ycq