|
Automorphisms of a distance-regular graph with intersection array $\{75,64,18,1;1,6,64,75\}$
A. Kh. Zhurtov, M. Kh. Shermetova Kabardino-Balkarian State University named
after H. M. Berbekov, Nal’chik, 360004 Russia
Abstract:
A distance-regular graph $\Gamma$ with intersection array $\{115,96,30,1;1,10,96,175\}$ is an $AT4$-graph. The antipodal quotient $\Gamma'$ has parameters $(392,115,18,40)$, and its first and second neighborhoods of vertices are strongly regular with parameters $(115,18,1,3)$ and $(276,75,10,24)$. Moreover, the second neighborhood of any vertex in $\Gamma_2(u)$ has intersection array $\{75,64,18,1;1,6,64,75\}$ and is a $4$-cover of a strongly regular graph with parameters $(276,75,10,24)$. Earlier, Makhnev, Paduchikh, and Samoilenko found possible automorphisms of a graph with parameters $(392,115,18,40)$ and of a graph with intersection array $\{115,96,30,1;1,10,96,175\}$. In this paper we find automorphisms of a graph with intersection array $\{75,64,18,1;1,6,64,75\}$. It is proved that the automorphism group of this graph acts intransitively on the set of its antipodal classes.
Keywords:
distance-regular graph, automorphism of a graph.
Received: 07.04.2017
Citation:
A. Kh. Zhurtov, M. Kh. Shermetova, “Automorphisms of a distance-regular graph with intersection array $\{75,64,18,1;1,6,64,75\}$”, Trudy Inst. Mat. i Mekh. UrO RAN, 23, no. 4, 2017, 128–135
Linking options:
https://www.mathnet.ru/eng/timm1473 https://www.mathnet.ru/eng/timm/v23/i4/p128
|
|