|
This article is cited in 1 scientific paper (total in 1 paper)
On automorphisms of a distance-regular graph with intersection array $\{99,84,1;1,12,99\}$
I. N. Belousovab 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.
Received: 22.04.2016
Citation:
I. N. Belousov, “On automorphisms of a distance-regular graph with intersection array $\{99,84,1;1,12,99\}$”, Trudy Inst. Mat. i Mekh. UrO RAN, 22, no. 3, 2016, 23–30; Proc. Steklov Inst. Math. (Suppl.), 297, suppl. 1 (2017), 19–26
Linking options:
https://www.mathnet.ru/eng/timm1318 https://www.mathnet.ru/eng/timm/v22/i3/p23
|
Statistics & downloads: |
Abstract page: | 167 | Full-text PDF : | 38 | References: | 32 |
|