|
This article is cited in 1 scientific paper (total in 1 paper)
Discrete mathematics and mathematical cybernetics
On automorphisms of a distance-regular graph with intersection array $\{119,100,15;1,20,105\}$
M. M. Isakovaa, A. A. Makhnevb a Kabardino-Balkarian State University named after H.M. Berbekov,
st. Chernyshevsky, 175,
360004, Nalchik, Russia
b N.N. Krasovsky Institute of Mathematics and Meckhanics,
str. S. Kovalevskoy, 16,
620990, Ekaterinburg, Russia
Abstract:
We study automorphisms of a hypothetical distance-regular graph with intersection array
$\{119,100,15;1,20,105\}$. It is proved that a vertex-transitive distance-regular graph with intersection array
$\{119,100,15;1,20,105\}$ has solvable automorphism group.
Keywords:
distance-regular graph, automorphism.
Received January 10, 2017, published March 13, 2018
Citation:
M. M. Isakova, A. A. Makhnev, “On automorphisms of a distance-regular graph with intersection array $\{119,100,15;1,20,105\}$”, Sib. Èlektron. Mat. Izv., 15 (2018), 198–204
Linking options:
https://www.mathnet.ru/eng/semr910 https://www.mathnet.ru/eng/semr/v15/p198
|
Statistics & downloads: |
Abstract page: | 244 | Full-text PDF : | 51 | References: | 40 |
|