AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the existence of a Moore graph of diameter r + 1 and valency ar+1 + 1 as a subgraph in Γ. In particular, we show that either ar+1 = 1 or r = 1
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractWe show that a distance-regular graph Г with Γ(x) ≃ 3 ∗ Ka1+1 (a1 ⩾ 2) for every x ∈ Γ and d...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
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 with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
AbstractLet Γ be a distance-regular graph withl(1,a1,b1)=1andcs+1=1for some positive integers.We sho...
AbstractIn this paper we give a sufficient condition for the existence of a strongly closed subgraph...
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, 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 witha1>0, r=max{j|(cj,aj,bj)=(c1,a1,b1)}≥2 andai=a1ci,for ...
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...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractIt is shown that any bipartite distance-regular graph with finite valency k and at least one...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractWe show that a distance-regular graph Г with Γ(x) ≃ 3 ∗ Ka1+1 (a1 ⩾ 2) for every x ∈ Γ and d...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
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 with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
AbstractLet Γ be a distance-regular graph withl(1,a1,b1)=1andcs+1=1for some positive integers.We sho...
AbstractIn this paper we give a sufficient condition for the existence of a strongly closed subgraph...
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, 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 witha1>0, r=max{j|(cj,aj,bj)=(c1,a1,b1)}≥2 andai=a1ci,for ...
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...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractIt is shown that any bipartite distance-regular graph with finite valency k and at least one...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractWe show that a distance-regular graph Г with Γ(x) ≃ 3 ∗ Ka1+1 (a1 ⩾ 2) for every x ∈ Γ and d...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
DOI
Add to ORKG