AbstractLet Γ be a distance-regular graph witha1>0, r=max{j|(cj,aj,bj)=(c1,a1,b1)}≥2 andai=a1ci,for 1≤i≤2r.Take anyuandvin Γ at distancer+1. We show that there exists a collinearity graph of a generalized 2(r+1)-gon of order (a1+1, crr+1-1)containinguandvas a subgraph in Γ
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
AbstractWe show that a distance-regular graph of valencyk>2 is antipodal, ifb2=1. This answers Probl...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractLet Γ be a distance-regular graph with r = l(1, a1, b1), a1 > 0 and c2r+1 = 1. We show the e...
AbstractIn this paper we give a sufficient condition for the existence of a strongly closed subgraph...
AbstractLet Γ be a distance-regular graph withl(1,a1,b1)=1andcs+1=1for some positive integers.We sho...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
AbstractLet Γ be a distance-regular graph with r = l(1, a1, b1), a1 > 0 and c2r+1 = 1. We show the e...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
AbstractWe show that a distance-regular graph of valencyk>2 is antipodal, ifb2=1. This answers Probl...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractLet Γ be a distance-regular graph with r = l(1, a1, b1), a1 > 0 and c2r+1 = 1. We show the e...
AbstractIn this paper we give a sufficient condition for the existence of a strongly closed subgraph...
AbstractLet Γ be a distance-regular graph withl(1,a1,b1)=1andcs+1=1for some positive integers.We sho...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
AbstractLet Γ be a distance-regular graph with r = l(1, a1, b1), a1 > 0 and c2r+1 = 1. We show the e...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
AbstractWe show that a distance-regular graph of valencyk>2 is antipodal, ifb2=1. This answers Probl...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
DOI
Add to ORKG