|
This article is cited in 2 scientific papers (total in 2 papers)
Mathematical logic, algebra and number theory
Automorphisms of a distance-regular graph with intersection array $\{176,150,1;1,25,176\}$
I. N. Belousov, A. A. Makhnev 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
$\{176,150,1;1,25,176\}$. It is proved that a distance-regular graph with intersection array $\{176,150,1;1,25,176\}$
is not vertex-transitive.
Keywords:
distance-regular graph, automorphism.
Received August 20, 2016, published September 28, 2016
Citation:
I. N. Belousov, A. A. Makhnev, “Automorphisms of a distance-regular graph with intersection array $\{176,150,1;1,25,176\}$”, Sib. Èlektron. Mat. Izv., 13 (2016), 754–761
Linking options:
https://www.mathnet.ru/eng/semr711 https://www.mathnet.ru/eng/semr/v13/p754
|
Statistics & downloads: |
Abstract page: | 217 | Full-text PDF : | 40 | References: | 51 |
|