AbstractLet Γ=(X,R) denote a d-bounded distance-regular graph with diameter d≥3. A regular strongly closed subgraph of Γ is said to be a subspace of Γ. For x∈X, let P(x) be the set of all subspaces of Γ containing x. For each i=1,2,…,d−1, let Δ0 be a fixed subspace with diameter d−i in P(x), and let ℒ(d,i)={Δ∈P(x)∣Δ+Δ0=Γ,d(Δ)=d(Δ∩Δ0)+i}∪{0̸}. If we define the partial order on ℒ(d,i) by ordinary inclusion (resp. reverse inclusion), then ℒ(d,i) is a finite poset, denoted by ℒO(d,i) (resp. ℒR(d,i)). In the present paper we show that both ℒO(d,i) and ℒR(d,i) are atomic, and compute their characteristic polynomials
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractLet Γ denote a d-bounded distance-regular graph with diameter d⩾2. A regular strongly closed...
AbstractLet Γ=(X,R) denote a d-bounded distance-regular graph with diameter d≥3. A regular strongly ...
AbstractLet Γ be a d-bounded distance-regular graph with diameter d⩾3. Suppose that P(x) is a set of...
AbstractLet Γ be a d-bounded distance-regular graph with diameter d≥3. For x∈V(Γ), let P(x) be the s...
Let Γ = (X,R) denote a distance-regular graph with diameter D ≥ 3 and distance function δ. A (vertex...
AbstractLet L be a finite set associated with cliques of a distance-regular graph of order (s,t), wi...
AbstractLet Γ=(X, R) denote a distance-regular graph with diameterD≥3 and distance functionδ. A (ver...
AbstractLet Γ be a d-bounded distance-regular graph with d≥3. Suppose that P(x) is a set of strongly...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractDistance regular graphs fall into three families: primitive, antipodal, and bipartite. Each ...
AbstractWe consider a class of distance-regular graphs Γ with diameter d whose intersection numbers ...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractLet Γ denote a d-bounded distance-regular graph with diameter d⩾2. A regular strongly closed...
AbstractLet Γ=(X,R) denote a d-bounded distance-regular graph with diameter d≥3. A regular strongly ...
AbstractLet Γ be a d-bounded distance-regular graph with diameter d⩾3. Suppose that P(x) is a set of...
AbstractLet Γ be a d-bounded distance-regular graph with diameter d≥3. For x∈V(Γ), let P(x) be the s...
Let Γ = (X,R) denote a distance-regular graph with diameter D ≥ 3 and distance function δ. A (vertex...
AbstractLet L be a finite set associated with cliques of a distance-regular graph of order (s,t), wi...
AbstractLet Γ=(X, R) denote a distance-regular graph with diameterD≥3 and distance functionδ. A (ver...
AbstractLet Γ be a d-bounded distance-regular graph with d≥3. Suppose that P(x) is a set of strongly...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractDistance regular graphs fall into three families: primitive, antipodal, and bipartite. Each ...
AbstractWe consider a class of distance-regular graphs Γ with diameter d whose intersection numbers ...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...