|
This article is cited in 2 scientific papers (total 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.
Citation:
Konstantin S. Efimov, Alexander A. Makhnev, “Automorphisms of a distance-regular graph with intersection array $\{39,36,4;1,1,36\}$”, Ural Math. J., 4:2 (2018), 69–78
Linking options:
https://www.mathnet.ru/eng/umj64 https://www.mathnet.ru/eng/umj/v4/i2/p69
|
Statistics & downloads: |
Abstract page: | 206 | Full-text PDF : | 55 | References: | 28 |
|