DOIAbstract
AbstractLet Γ be a distance-regular graph withl(1,a1,b1)=1andcs+1=1for some positive integers.We show the existence of a certain distance-regular graph of diameters,containing given two vertices at distances,as a subgraph in Γ
AbstractLet Γ be a distance-regular graph withl(1,a1,b1)=1andcs+1=1for some positive integers.We show the existence of a certain distance-regular graph of diameters,containing given two vertices at distances,as a subgraph in Γ
AbstractWe find that certain distance-regular graphs must contain Pappus subgraphs and, as a corolla...
AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
This thesis is an exposition of the paper of Paul Terwilliger entitled Distance-Regular Graphs and (...
AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
AbstractIn this paper we give a sufficient condition for the existence of a strongly closed subgraph...
AbstractLet Γ be a distance-regular graph with r = l(1, a1, b1), a1 > 0 and c2r+1 = 1. We show the e...
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...
AbstractLet Γ be a distance-regular graph witha1>0, r=max{j|(cj,aj,bj)=(c1,a1,b1)}≥2 andai=a1ci,for ...
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 ...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
We prove that there is no distance-regular graph T having intersection array [diagram] with diameter...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractWe find that certain distance-regular graphs must contain Pappus subgraphs and, as a corolla...
AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
This thesis is an exposition of the paper of Paul Terwilliger entitled Distance-Regular Graphs and (...
AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
AbstractIn this paper we give a sufficient condition for the existence of a strongly closed subgraph...
AbstractLet Γ be a distance-regular graph with r = l(1, a1, b1), a1 > 0 and c2r+1 = 1. We show the e...
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...
AbstractLet Γ be a distance-regular graph witha1>0, r=max{j|(cj,aj,bj)=(c1,a1,b1)}≥2 andai=a1ci,for ...
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 ...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
We prove that there is no distance-regular graph T having intersection array [diagram] with diameter...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractWe find that certain distance-regular graphs must contain Pappus subgraphs and, as a corolla...
AbstractLet Γ be a distance-regular graph with r = l(1, 0, k − 1) > 0 and c2r+1 = 1. We show the exi...
This thesis is an exposition of the paper of Paul Terwilliger entitled Distance-Regular Graphs and (...
Add to ORKG