Distance-regular Subgraphs in a Distance-regular Graph, III

@article{Hiraki1996DistanceregularSI,
  title={Distance-regular Subgraphs in a Distance-regular Graph, III},
  author={Akira Hiraki},
  journal={Eur. J. Comb.},
  year={1996},
  volume={17},
  pages={629-636}
}
depend only on j 5 ­ G ( u , x ) rather than on individual vertices . It is easy to see that if G is a distance-regular graph , then k G ( u ) and d G ( u ) do not depend on the choice of u . Hence we write k G and d G . They are called the y alency and the diameter of G . Sometimes we omit the suf fix when the graph concerned is clear . The numbers c i , a i and b i are called the intersection numbers of G . The following are well known basic properties which we use implicitly in this paper… CONTINUE READING