RUS  ENG
Full version
JOURNALS // Ural Mathematical Journal // Archive

Ural Math. J., 2018 Volume 4, Issue 2, Pages 69–78 (Mi umj64)

This article is cited in 2 papers

Automorphisms of a distance-regular graph with intersection array $\{39,36,4;1,1,36\}$

Konstantin S. Efimova, Alexander A. Makhnevb

a Ural State University of Economics, 62 March 8th Str., Ekaterinburg, Russia, 620144
b Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 16 S. Kovalevskaya Str., Ekaterinburg, Russia, 620990

Abstract: Makhnev and Nirova have found intersection arrays of distance-regular graphs with no more than 4096 vertices, in which $\lambda=2$ and $\mu=1$. They proposed the program of investigation of distance-regular graphs with $\lambda=2$ and $\mu=1$. In this paper the automorphisms of a distance-regular graph with intersection array $\{39, 36, 4; 1, 1, 36\}$ are studied.

Keywords: Strongly regular graph, Distance-regular graph.

Language: English

DOI: 10.15826/umj.2018.2.008



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025