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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-002-0521-9