Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 

 

A lower bound on the number of vertices of a graph


Authors: V. G. Kane and S. P. Mohanty
Journal: Proc. Amer. Math. Soc. 72 (1978), 211-212
MSC: Primary 05-XX
MathSciNet review: 524348
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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 [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05-XX

Retrieve articles in all journals with MSC: 05-XX


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1978-0524348-3
Article copyright: © Copyright 1978 American Mathematical Society