On automorphisms of a graph with an intersection array $\{44,30,9;1,5,36\}$

For the set $X$ automorphisms of the graph $\Gamma$ let ${\rm Fix}(X)$ be a set of all vertices of $\Gamma$ fixed by any automorphism from $X$. There are $7$ feasible intersection arrays of distance regular graphs with diameter $3$ and degree $44$. Early it was proved that for fifth of them graphs do not exist. In this paper it is founded possible automorphisms of distance regular graph with intersection array $\{44,30,9;1,5,36\}$. The proof of the theorem is based on Higman’s method of working with automorphisms of a distance regular graph. The consequence of the main result is is the following: Let $\Gamma$ be a distance regular graph with intersection array $\{44,30,9;1,5,36\}$ and the group $G={\rm Aut}(\Gamma)$ acts vertex-transitively; then $G$ acts intransitively on the set arcs of $\Gamma$.