Skip to main content
SpringerLink
Log in

The Number of Columns (1,k−2,1) in the Intersection Array of a Distance-Regular Graph

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

In this paper we consider the number t of columns (1,k−2,1) in the intersection array of a distance-regular graph. We prove that t is at most one if k≥58.

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. Division of Mathematical Sciences, Osaka Kyoiku University, Kashiwara, Osaka, 582-8582, Japan

    Akira Hiraki

Authors
  1. Akira Hiraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Akira Hiraki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hiraki, A. The Number of Columns (1,k−2,1) in the Intersection Array of a Distance-Regular Graph. Graphs and Combinatorics 19, 371–387 (2003). https://doi.org/10.1007/s00373-002-0521-9

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0521-9

Keywords

Search

Navigation