Contents

-

Lattices Associated with Subspaces in d-Bounded Distance-Regular Graphs

Jun Guo1
1Math. and Inf. College, Langfang Teachers’ College, Langfang, 065000, P. R. China

Abstract

Let Γ=(X,R) denote a d-bounded distance-regular graph with diameter d3. A regular strongly closed subgraph of Γ is said to be a subspace of Γ. For 0ii+sd1, suppose Δi and Δ0 are subspaces with diameter i and i+s, respectively, and with ΔiΔ0. Let L(i,i+s;d) denote the set of all subspaces Δ with diameters i such that d(Δ0Δ)=Δ1 and d(Δ0+Δ)=d(Δ)+s in Γ$including\(Δ0. If we partial order L(i,i+s;d) by ordinary inclusion (resp. reverse inclusion), then L(i,i+s;d) is a poset, denoted by L0(i,i+s;d) (resp. LR(i,i+s;d)). In the present paper, we show that both L0(i,i+s;d) and LR(i,i+s;d) are atomic lattices, and classify their geometricity.