A Bound for the Diameter of Distance-Regular Graphs

Combinatorica volume 19, pages549–553(1999)Cite this article

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.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

Author information

Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences; Budapest, P.O.B. 127, H–1364 Hungary; E-mail: pyber@math-inst.hu, HU

    L. Pyber

Authors
  1. L. Pyber
    View author publications

    You can also search for this author in PubMed Google Scholar

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