Title of article
An inequality for regular near polygons
Author/Authors
Terwilliger، نويسنده , , Paul and Weng، نويسنده , , Chih-wen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
9
From page
227
To page
235
Abstract
Let Γ denote a near polygon distance-regular graph with diameter d≥3, valency k and intersection numbers a1>0, c2>1. Let θ1 denote the second largest eigenvalue of Γ. We showθ1≤k−a1−c2c2−1.We show the following (i)–(iii) are equivalent. (i) Equality is attained above; (ii) Γ is Q-polynomial with respect to θ1; (iii) Γ is a dual polar graph or a Hamming graph.
Keywords
Near polygon , Distance-regular graph , Q-polynomial , Hamming graph , Dual polar graph
Journal title
European Journal of Combinatorics
Serial Year
2005
Journal title
European Journal of Combinatorics
Record number
1546985
Link To Document