A Lower Bound on the Number of Vertices of a Graph
V. G. Kane, S. P. Mohanty · Proceedings of the American Mathematical Society · 1978
In this note, we derive a lower bound for the number of vertices of a graph in terms of its diameter, d, connectivity k and minimum degree $\rho$ which is sharper than that of Watkins [1] by an amount $2(\rho - k)$.