Skip to main content
SpringerLink
Log in

A Bound for the Diameter of Distance-Regular Graphs

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and 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

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004939970006

Search

Navigation