About automorphisms of graphs with intersection arrays {44,40,12;1,5,33} and {48,35,9;1,7,40}

Distance-regular graph Γ of diameter 3 with strongly regular graphs Γ2 and Γ3 has intersection array {r(c2+1)+a3, r c2, a3 + 1; 1, c2, r(c2 + 1)} (M.S. Nirova). For distance-regular graph Γ of diameter 3 and degree 44 there are exactly 7 feasible intersection arrays. For each of them graph Γ3 is strongly regular. For intersection array {44, 30, 5; 1, 3, 40} we have a3 = 4, c2 = 3, r = 10, Γ2 has parameters (540,440,358,360) and Γ3 has parameters (540,55,10,5). Graph does not exist (Koolen-Park). For intersection array {44, 35, 3; 1, 5, 42} graph Γ3 has parameters (375,22,5,1) and does not exist (its neighbourhood of vertex is the union of isolated 6-cliques). In this paper it is found futomorphisms of graphs with intersection arrays {44,40,12; 1,5,33 and 48,35,9; 1,7,40}.