|
This article is cited in 3 scientific papers (total in 3 papers)
Discrete mathematics and mathematical cybernetics
On automorphisms of a distance-regular graph with intersection array $\{96,76,1;1,19,96\}$
A. A. Makhneva, M. Kh. Shermetovab a N.N. Krasovsky Institute of Mathematics and Meckhanics,
str. S. Kovalevskoy, 16,
620990, Ekaterinburg, Russia
b Kabardino-Balkarian State University named after H.M. Berbekov,
st. Chernyshevsky, 175,
360004, Nalchik, Russia
Abstract:
We study automorphisms of a hypothetical distance-regular graph with intersection array $\{96,76,1;1,19,96\}$. It is proved that a distance-regular graph with intersection array $\{96,76,1;1,19,96\}$ is not vertex-transitive.
Keywords:
distance-regular graph, automorphism.
Received December 1, 2017, published February 26, 2018
Citation:
A. A. Makhnev, M. Kh. Shermetova, “On automorphisms of a distance-regular graph with intersection array $\{96,76,1;1,19,96\}$”, Sib. Èlektron. Mat. Izv., 15 (2018), 167–174
Linking options:
https://www.mathnet.ru/eng/semr907 https://www.mathnet.ru/eng/semr/v15/p167
|
|