Email this article Automorphism Group of a Distance-Regular Graph with Intersection Array {35, 32, 1; 1, 4, 35}
- Authors: Bitkina V.V.1, Makhnev A.A.2
-
Affiliations:
- Khetagurov North Ossetian State University
- Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences
- Issue: Vol 56, No 6 (2018)
- Pages: 443-450
- Section: Article
- URL: https://journals.rcsi.science/0002-5232/article/view/234061
- DOI: https://doi.org/10.1007/s10469-018-9466-9
- ID: 234061
Cite item
Open Access
Access granted
Subscription Access
Abstract
Let Γ be a distance regular graph with intersection array {35, 32, 1; 1, 4, 35} and let G = Aut(Γ) act transitively on the set of vertices of the graph Γ. It is shown that G is a {2, 3}-group.
About the authors
V. V. Bitkina
Khetagurov North Ossetian State University
Author for correspondence.
Email: bviktoriyav@mail.ru
Russian Federation, ul. Vatutina 46, Vladikavkaz, 362025
A. A. Makhnev
Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences
Author for correspondence.
Email: makhnev@imm.uran.ru
Russian Federation, ul. S. Kovalevskoi 16, Ekaterinburg, 620990
Supplementary files
