Distance-regular graphs with Γ (x)≃ 3∗ Ka+ 1
N Yamazaki - European Journal of Combinatorics, 1995 - Elsevier
We show that a distance-regular graph Г with Γ (x)≃ 3∗ K a1+ 1 (a 1⩾ 2) for every x∈ Γ and
d⩾ r (Γ)+ 3 is a distance-2 graph of a distance-biregular graph with vertices of valency 3. In …
d⩾ r (Γ)+ 3 is a distance-2 graph of a distance-biregular graph with vertices of valency 3. In …
[引用][C] Distance-regular graphs with G(x)≃3*K a+1
N Yamazaki - European Journal of Combinatorics, 1995 - dl.acm.org
Distance-regular graphs with G(x)≃3*K a+1 | European Journal of Combinatorics skip to
main content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search …
main content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search …
[PDF][PDF] Distance-regular Graphs with F (x)---3* Ko+~
N YAMAZAKI - core.ac.uk
Distance-regular Graphs with F(x)---3 *Ko+~ c,(6,/3) = Ir,_,(6) nr(/3)l, a,(-,/3) = Ir,(,,) nr(/3)l, r(6)
-- m * K,+~ Page 1 Europ. J. Combinatorics (1995) 16, 525-536 Distance-regular Graphs with …
-- m * K,+~ Page 1 Europ. J. Combinatorics (1995) 16, 525-536 Distance-regular Graphs with …