Дистанционно регулярный граф с массивом пересечений $\{105,72,24;1,12,70\}$ не существует

Distance-regular graph $\Gamma$ of diameter 3 is called Shilla graph if $\Gamma$ containes the second eigenvalue $\theta_1=a_3$. In this case $a=a_3$ devides $k$ and we set $b=b(\Gamma)=k/a$. Koolen and Park obtained the list of intersection arrays for Shilla graphs with $b=3$. A. Brouwer with coauthors proved that graph with intersection array $\{27,20,10;1,2,18\}$ does not exist. $Q$-polinomial Shilla graph with $b=3$ has intersection array $\{42,30,12;1,6,28\}$ or $\{105,72,24;1,12,70\}$. Early authors proved that graph with intersection array $\{42,30,12;1,6,28\}$ does not exist.
We prove that graph with intersection array $\{105,72,24;1,12,70\}$ does not exist.