A Bound for the Diameter of Distance-Regular Graphs

n

vertices has diameter at most 5 logn. This essentially settles a problem of Brouwer, Cohen and Neumaier.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received: October 2, 1998

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Pyber, L. A Bound for the Diameter of Distance-Regular Graphs. Combinatorica 19, 549–553 (1999). https://doi.org/10.1007/s004939970006

Download citation

  • AMS Subject Classification (1991) Classes:  05E30, 05C12