3-bounded property in a triangle-free distance-regular graph

Yeh-jong Pan; Chih-wen Weng

3-bounded property in a triangle-free distance-regular graph

Combinatorics 2007-09-06 v1

Authors: Yeh-jong Pan , Chih-wen Weng

Abstract

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D, b, \alpha, \beta)$ and $D\geq 3$ . Assume the intersection numbers $a_1=0$ and $a_2\not=0$ . We show $\Gamma$ is 3-bounded in the sense of the article [D-bounded distance-regular graphs, European Journal of Combinatorics(1997)18, 211-229].

Keywords

graph theory graph theory of groups gamma-convergence and homogenization

Cite

@article{arxiv.0709.0564,
  title  = {3-bounded property in a triangle-free distance-regular graph},
  author = {Yeh-jong Pan and Chih-wen Weng},
  journal= {arXiv preprint arXiv:0709.0564},
  year   = {2007}
}

Comments

13 pages

Related papers

View all related →