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

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

2007-09-05

arxiv.org/abs/0709.0564v1

Mathematics

Combinatorics

13 pages

Scientific paper

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].

Affiliated with

Also associated with

No associations

Rating

3-bounded property in a triangle-free distance-regular graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 3-bounded property in a triangle-free distance-regular graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 3-bounded property in a triangle-free distance-regular graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-469964