Abstract.
The height of a distance-regular graph of the diameter d is defined by h=max{j|p d d,j≠0}. We show that if Γ is a distance-regular graph of diameter d, height h>1 and every p d d,h-graph is a clique, then h∈{d−1,d}.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Revised: November 30, 1998
Rights and permissions
About this article
Cite this article
Hiraki, A. Distance-regular Graphs of the Height h . Graphs Comb 15, 417–428 (1999). https://doi.org/10.1007/s003730050075
Issue Date:
DOI: https://doi.org/10.1007/s003730050075