Automorphism Groups of Small Distance-Regular Graphs

Resumo

We consider undirected graphs without loops and multiple edges. Previously, V. P. Burichenko and A. A. Makhnev [1] found intersection arrays of distance-regular locally cyclic graphs with the number of vertices at most 1000. It is shown that the automorphism group of a graph with intersection array {15, 12, 1; 1, 2, 15}, {35, 32, 1; 1, 2, 35}, {39, 36, 1; 1, 2, 39}, or {42, 39, 1; 1, 3, 42} (such a graph enters the above-mentioned list) acts intransitively on the set of its vertices.