AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c1,a1,b1)}. We give a necessary and sufficient condition for the existence of a strongly closed subgraph which is (cr+1+ar+1)-regular of diameterr+1 containing a given pair of vertices at distancer+1
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 witha1>0, r=max{j|(cj,aj,bj)=(c1,a1,b1)}≥2 andai=a1ci,for ...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
AbstractIn this paper we give a sufficient condition for the existence of a strongly closed subgraph...
AbstractLet Γ be a distance-regular graph with (c1,b1) =⋯=(cr,br) ≠ (cr+1,br+1)= ⋯=(c2r,b2r) wherer≥...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
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, 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...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
AbstractLet Γ denote a distance-regular graph with a strongly closed regular subgraph Y. Hosoya and ...
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 study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
In this paper, we give necessary and sufficient conditions for the existence of two types of strongl...
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 witha1>0, r=max{j|(cj,aj,bj)=(c1,a1,b1)}≥2 andai=a1ci,for ...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
AbstractIn this paper we give a sufficient condition for the existence of a strongly closed subgraph...
AbstractLet Γ be a distance-regular graph with (c1,b1) =⋯=(cr,br) ≠ (cr+1,br+1)= ⋯=(c2r,b2r) wherer≥...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
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, 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...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
AbstractLet Γ denote a distance-regular graph with a strongly closed regular subgraph Y. Hosoya and ...
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 study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
In this paper, we give necessary and sufficient conditions for the existence of two types of strongl...
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 witha1>0, r=max{j|(cj,aj,bj)=(c1,a1,b1)}≥2 andai=a1ci,for ...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
DOI
Add to ORKG