A characterization of $Q$-polynomial distance-regular graphs using the intersection numbers

Supalak Sumalroj

We consider a primitive distance-regular graph $\Gamma$ with diameter at least $3$. We use the intersection numbers of $\Gamma$ to find a positive semidefinite matrix $G$ with integer entrie…