Automorphisms of a graph with intersection array \(\{115,96,30,1;1,10,96,115\}\) (Q2353020)

In this paper, the authors consider automorphisms . Let \(\Gamma\) be an undirected graph without loops, and let \(u,w\) be vertices of \(\Gamma\) such that \(d(u,w)=i\). Denote by \(b_i(u,w)\) (respectively \(c_i(u,w)\)) the number of vertices in the neighborhood of \(w\) that have distance \(i+1\) (respectively \(i-1\)) from \(u\). The graph is said to be a distance-regular graph with intersection array \(\{b_0,\dots,b_{d-1};c_1\dots,c_d\}\) if \(b_i(u,w)\) and \(c_i(u,w)\) are independent of the choice of the vertices \(u\), \(w\) separated by the distance \(i\). The authors study the automorphisms of a strongly regular graph with parameters (115,18,1,3), and of a distance regular graph with the intersection array \(\{115, 96, 30, 1; 1, 10, 96, 115\}\). The allowed orders, and subgraphs of fixed points are provided, together with a few auxiliary results.