|
Automorphism group of a distanceregular graph with intersection array $\{35,32,1;1,4,35\}$
V. V. Bitkinaa, A. A. Makhnevb a Khetagurov North Ossetian State University, ul. Vatutina 46, Vladikavkaz, 362025 Russia
b Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi 16, Yekaterinburg, 620990 Russia
Abstract:
Let $\Gamma$ be a distance regular graph with intersection array $\{35,32,1;1,4,35\}$ and let $G=\operatorname{Aut}(\Gamma)$ act transitively on the set of vertices of the graph $\Gamma$. It is shown that $G$ is a $\{2,3\}$-group.
Keywords:
distance-regular graph, itersection array, automorphism group.
Received: 27.01.2016 Revised: 20.10.2016
Citation:
V. V. Bitkina, A. A. Makhnev, “Automorphism group of a distanceregular graph with intersection array $\{35,32,1;1,4,35\}$”, Algebra Logika, 56:6 (2017), 671–681; Algebra and Logic, 56:6 (2018), 443–450
Linking options:
https://www.mathnet.ru/eng/al823 https://www.mathnet.ru/eng/al/v56/i6/p671
|
Statistics & downloads: |
Abstract page: | 251 | Full-text PDF : | 29 | References: | 50 | First page: | 13 |
|