Lattices associated with distance-regular graphs

AbstractLet L be a finite set associated with cliques of a distance-regular graph of order (s,t), with d-cliques of Johnson graphs and antipodal distance-regular graphs of diameter d, respectively. If we partially order L by the ordinary inclusion, three families of finite atomic lattices are obtained. This article discusses their geometricity, and computes their characteristic polynomials