On antipodal distance-regular graphs with \(\mu=1\) (Q352218)

A graph \(\Gamma\) is a regular graph with parameters \((v,k,\lambda,\mu)\) if \(\Gamma\) is a regular graph of degree \(k\) on \(v\) vertices, in which each edge lies in precisely \(\lambda\) triangles and \(|[a]\cap[b]|=\mu\) for any two nonadjacent vertices \(a\) and \(b\), where \([a]\) is the degree of the vertex \(a\). \(b_i(u,w)\) (by \((c_i(u,w)\)) we denote the number of vertices in the intersection of \(\Gamma_{i+1}(u)\) (\(\Gamma_{i-1}(u)\)) with \([w]\), where \(\Gamma_{i+1}(u)\) is the subgraph induced by \(\Gamma\) on the set of all vertices at a distance \(i\) from \(a\). A graph \(\Gamma\) of diameter \(d\) is called a distance regular graph with intersection array \(\{b_0,b_1,\dots, b_{d-1};c_1,c_2,\dots,c_d\}\) if the quantities \(b_i(u,w)\) and \(c_i(u,w)\) do not depend on the choice of the vertices \(u\) and \(w\) at distance \(i\) in \(\Gamma\) and are equal to \(b_i\) and \(c_i\) for \(i=0,1,\dots,d\). The author finds the intersections arrays for antipodal distance regular graphs of \(3\) with \(\lambda\leq 2\) and \(\mu=1\). The author also finds all possible orders and subgraphs of fixed points of automorphisms for a distance regular graph with intersection array \(\{42,39,1;1,1,42\}\).