|
This article is cited in 1 scientific paper (total in 1 paper)
Automorphisms of Graphs with Intersection Arrays $\{60,45,8;1,12,50\}$ and $\{49,36,8;1,6,42\}$
A. L. Gavrilyuk, A. A. Makhnev Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
Abstract:
Automorphisms of distance-regular graphs are considered. It is proved that any graph with the intersection array $\{60,45,8;1,12,50\}$ is not vertex symmetric, and any graph with the intersection array $\{49,36,8;1,6,42\}$ is not edge symmetric.
Keywords:
distance regular graph, vertex symmetric graph.
Received: 27.01.2016 Revised: 07.06.2016
Citation:
A. L. Gavrilyuk, A. A. Makhnev, “Automorphisms of Graphs with Intersection Arrays $\{60,45,8;1,12,50\}$ and $\{49,36,8;1,6,42\}$”, Mat. Zametki, 101:6 (2017), 823–831; Math. Notes, 101:6 (2017), 942–950
Linking options:
https://www.mathnet.ru/eng/mzm11100https://doi.org/10.4213/mzm11100 https://www.mathnet.ru/eng/mzm/v101/i6/p823
|
Statistics & downloads: |
Abstract page: | 1815 | Full-text PDF : | 56 | References: | 56 | First page: | 26 |
|