RUS  ENG
Full version
JOURNALS // Matematicheskie Zametki // Archive

Mat. Zametki, 2017 Volume 101, Issue 6, Pages 823–831 (Mi mzm11100)

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

UDC: 519.17

Received: 27.01.2016
Revised: 07.06.2016

DOI: 10.4213/mzm11100


 English version:
Mathematical Notes, 2017, 101:6, 942–950

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024