An inequality for regular near polygons (Q1765606)

Let \(\Gamma\) be a near polygon distance-regular graph with diameter \(d\geq 3\), valency \(k\) and eigenvalues \(\theta_0>\theta_1>\cdots >\theta_d\). Suppose that \(a_1>0\) and \(c_2>1\). It is known that \(\theta_0=k\) and \(\theta_d\geq -k(a_1+1)\) with equality if and only if \(\Gamma\) is a near \(2d\)-gon. Theorem 1.1. Let \(\Gamma\) be a near polygon distance-regular graph with diameter \(d\geq 3\), valency \(k\) and intersection numbers \(a_1>0\), \(c_2>1\). Let \(\theta_1\) denote the second largest eigenvalue of \(\Gamma\). Then \(\theta_1\leq (k-a_1-c_2)/(c_2-1)\). Moreover the following statements are equivalent: (i) \(\theta_1=(k-a_1-c_2)/(c_2-1)\); (ii) \(\Gamma\) is \(Q\)-polynomial with respect to \(\theta_1\); and (iii) \(\Gamma\) is a dual polar graph or a Hamming graph.