A lower bound on the number of vertices of a graph
HTML articles powered by AMS MathViewer
- by V. G. Kane and S. P. Mohanty PDF
- Proc. Amer. Math. Soc. 72 (1978), 211-212 Request permission
Abstract:
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)$.References
- M. E. Watkins, A lower bound for the number of vertices of a graph, Amer. Math. Monthly 74 (1967), 297. MR 207592, DOI 10.2307/2316031
Additional Information
- © Copyright 1978 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 72 (1978), 211-212
- MSC: Primary 05-XX
- DOI: https://doi.org/10.1090/S0002-9939-1978-0524348-3
- MathSciNet review: 524348