1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs

Brian Curtin, Kazumasa Nomura. 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs. Journal of Combinatorial Theory, Series A, 93(2):279-302, 2005. [doi]

@article{CurtinN05,
  title = {1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs},
  author = {Brian Curtin and Kazumasa Nomura},
  year = {2005},
  doi = {10.1016/j.jctb.2004.10.003},
  url = {http://dx.doi.org/10.1016/j.jctb.2004.10.003},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/CurtinN05},
  cites = {0},
  citedby = {0},
  journal = {Journal of Combinatorial Theory, Series A},
  volume = {93},
  number = {2},
  pages = {279-302},
}