Sciweavers

Share
EJC
2008

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

8 years 2 months ago
3-bounded property in a triangle-free distance-regular graph
Let denote a distance-regular graph with classical parameters (D, b, , ) and D 3. Assume the intersection numbers a1 = 0 and a2 = 0. We show is 3-bounded in the sense of the article [D-bounded Distance-regular graphs, European Journal of Combinatorics(1997)18, 211-229].
Yeh-jong Pan, Chih-wen Weng
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where EJC
Authors Yeh-jong Pan, Chih-wen Weng
Comments (0)
books