An inequality for regular near polygons
| dc.creator | Terwilliger, Paul | |
| dc.creator | Weng, Chih-wen | |
| dc.date | 2003-12-07 | |
| dc.date.accessioned | 2026-07-07T05:03:38Z | |
| dc.date.available | 2026-07-07T05:03:38Z | |
| dc.description | Let $G$ denote a near-polygon distance-regular graph with diameter $d\geq 3$, valency $k$ and intersection numbers $a_1>0$, $c_2>1$. Let $θ_1$ denote the second largest eigenvalue for the adjacency matrix of $G$. We show $θ_1$ is at most $(k-a_1-c_2)/(c_2-1)$. We show the following are equivalent: (i) Equality is attained above; (ii) $G$ is $Q$-polynomial with respect to $θ_1$; (iii) $G$ is a dual polar graph or a Hamming graph. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/math/0312149 | |
| dc.identifier | http://arxiv.org/abs/math/0312149 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69501 | |
| dc.subject | Combinatorics | |
| dc.subject | 05E30 | |
| dc.title | An inequality for regular near polygons | |
| dc.type | text |