Twice Q-polynomial distance-regular graphs are thin (Q1902962): Difference between revisions

The author shows that if a distance-regular graph \(\Gamma\) of diameter \(d\geq 3\) is \(Q\)-polynomial with respect to distinct eigenvalues, then \(\Gamma\) is thin in the sense of Terwilliger.