|
Automorphisms of a distance-regular graph with intersection array {196, 156, 1; 1, 39, 196}
A. A. Tokbaeva Kabardino-Balkar State University, Nal'chik
Abstract:
A. Makhnev and M. Samoilenko found intersection arrays of antipodal distance-regular graphs of diameter 3 and degree at most 1000 in which $\lambda=\mu$ and the neighborhoods of vertices are strongly regular. Automorphisms of distance-regular graphs in which the neighborhoods of vertices are strongly regular with second eigenvalue 3 except for graphs with intersection arrays $\{196,156,1;1,39,196\}$ and $\{205,136,1;1,68,205\}$ were found earlier. We find possible prime orders of elements in the automorphism group of a distance-regular graph with intersection array $\{196,156,1;1,39,196\}$ as well as their fixed-point subgraphs. It is proved that the automorphism group of this graph acts intransitively on the vertex set.
Keywords:
distance-regular graph, automorphism.
Received: 21.05.2018
Citation:
A. A. Tokbaeva, “Automorphisms of a distance-regular graph with intersection array {196, 156, 1; 1, 39, 196}”, Trudy Inst. Mat. i Mekh. UrO RAN, 24, no. 3, 2018, 226–232
Linking options:
https://www.mathnet.ru/eng/timm1564 https://www.mathnet.ru/eng/timm/v24/i3/p226
|
Statistics & downloads: |
Abstract page: | 120 | Full-text PDF : | 30 | References: | 32 | First page: | 1 |
|