I. N. Belousov, “On automorphisms of a distance-regular graph with intersection array <nobr>$\{99,84,1;1,12,99\}$</nobr>”, Trudy Inst. Mat. i Mekh. UrO RAN, 2016, Volume 22, Number 3,Pages <nobr>23

This article is cited in 1 paper

On automorphisms of a distance-regular graph with intersection array $\{99,84,1;1,12,99\}$

I. N. Belousov^ab

^a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
^b Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg

Abstract: We find possible orders and fixed point subgraphs of a hypothetical distance-regular graph with intersection array $\{99,84,1;1,12,99\}$. It is shown that, if $\Gamma$ is a vertex-symmetric graph with intersection array $\{99,84,1;1, 12,99\}$, then its automorphism group is a $\{2,3,5\}$-group.

Keywords: distance-regular graph, automorphism of a graph.

UDC: 519.17

MSC: 05C25

Received: 22.04.2016

DOI: 10.21538/0134-4889-2016-22-3-23-30