Об автоморфизмах дистанционно регулярного графа с массивом пересечений $\{243,220,1;1,4,243\}$

It was proved that a distance regular graph in which neighborhoods of vertices are strongly regular with parameters $(243,22,1,2)$ has intersection array $\{243,220,1;1,22,243\}$ or $\{243,220,1;1,4,243\}$. In this paper we found the automorphisms of a distance regular graph with intersection array $\{243,220,1;1,4,243\}$. In particular, this graph is not vertex-symmetric.