Abstract. Let Γ denote a distance-regular graph with classical parameters ( D , b , α , β ) and D ⩾ 3 . Assume the intersection numbers a 1 = 0 and a 2 ≠ 0 .

Aug 9, 2008 · Note. A note on triangle-free distance-regular graphs with a2 = 0. ✩. Yeh-jong Pan, Chih-wen Weng. Department of Applied Mathematics, National ...

Let Γ denote a distance-regular graph with classical parameters and D ≥ 3. Assume the intersection numbers a1 = 0 and a2 ≠ 0.

TL;DR: In this paper, a package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular ...

Let Γ denote a distance-regular graph with classical parameters ( D , b , α , β ) and D ⩾ 3 . Assume the intersection numbers a 1 = 0 and a 2 ≠ 0 .

Let Gamma be a triangle-free distance-regular graph with diameter d >= 3, valency k >= 3 and intersection number a(2) not equal 0.

A note on triangle-free distance-regular graphs with a2!=0 · Yeh-jong PanChih-wen Weng. Mathematics. J. Comb. Theory B. 2009. 8 Citations · Highly Influenced.

... note that the graphs under assumption a2 = 0 instead of a2 6= 0 have already been classified in [7]). Then the graph Γ is an example of a triangle-free distance ...

Dec 19, 2014 · This is a survey of distance-regular graphs. We present an introduction to distance- regular graphs for the reader who is unfamiliar with the ...

Sep 5, 2007 · In this note, we study distance-regular graphs with classical parameters (D, b, α, β), D ≥ 3, a1 = 0, and a2 6= 0 (hence b < −1 by [6 ...