首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The girth of a thin distance-regular graph
Authors:Benjamin V C Collins
Institution:1. Department of Mathematics, University of Wisconsin, 480 Lincoln Drive, 53706, Madison, WI, USA
Abstract:Let Γ be a distance-regular graph of diameterd≥3. For each vertexx of Γ, letT(x) denote the Terwilliger algebra for Γ with respect tox. An irreducibleT(x)-moduleW is said to bethin if dimE i * (x)W≤1 for 0≤id, whereE i * (x) is theith dual idempotent for Γ with respect tox. The graph Γ isthin if for each vertexx of Γ, every irreducibleT(x)-module is thin. Aregular generalized quadrangle is a bipartite distance-regular graph with girth 8 and diameter 4. Our main results are as follows: Theorem. Let Γ=(X,R) be a distance-regular graph with diameter d≥3 and valency k≥3. Then the following are equivalent:
  1. Γis a regular generalized quadrangle.
  2. Γis thin and c 3=1.
Corollary. Let Γ=(X,R) be a thin distance-regular graph with diameter d≥3 and valency k≥3. Then Γ has girth 3, 4, 6, or 8. Then girth of Γ is 8 exactly when Γ is a regular generalized quadrangle.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号