RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive

Sib. Èlektron. Mat. Izv., 2018 Volume 15, Pages 167–174 (Mi semr907)

This article is cited 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.

UDC: 519.17

MSC: 05C25

Received December 1, 2017, published February 26, 2018

DOI: 10.17377/semi.2018.15.016



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025