Acta mathematica scientia,Series A ›› 2011, Vol. 31 ›› Issue (2): 492-499.

• Articles • Previous Articles     Next Articles

Lattices Associated with Distance-Regular Graphs I

 LI Zeng-Ti   

  1. Department of Mathematics, Langfang Normal College, Hebei Langfang |065000
  • Received:2008-04-12 Revised:2010-04-29 Online:2011-04-25 Published:2011-04-25
  • Supported by:

    国家自然科学基金(10971052)和廊坊师范学院重点科研项目基金(LSZZ200901)资助

Abstract:

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

Key words: Distance-regular graph, Clique, Geometric lattice

CLC Number: 

  • 20G40
Trendmd