Automorphism Group of a Distance-Regular Graph with Intersection Array {35,32,1;1,4,35}

被引:0
作者
Bitkina, V. V. [1 ]
Makhnev, A. A. [2 ]
机构
[1] Khetagurov North Ossetian State Univ, Ul Vatutina 46, Vladikavkaz 362025, Russia
[2] Russian Acad Sci, Krasovskii Inst Math & Mech, Ural Branch, Ul S Kovalevskoi 16, Ekaterinburg 620990, Russia
基金
俄罗斯科学基金会;
关键词
distance-regular graph; intersection array; automorphism group;
D O I
10.1007/s10469-018-9466-9
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let I" be a distance regular graph with intersection array {35, 32, 1; 1, 4, 35} and let G = Aut(I") act transitively on the set of vertices of the graph I". It is shown that G is a {2, 3}-group.
引用
收藏
页码:443 / 450
页数:8
相关论文
共 6 条
[1]   Automorphism Groups of Small Distance-Regular Graphs [J].
Belousov, I. N. ;
Makhnev, A. A. .
ALGEBRA AND LOGIC, 2017, 56 (04) :261-268
[2]  
Burichenko V. P., 2011, CONT PROBLEMS MATH, P181
[3]  
Cameron P.J., 1999, PERMUTATION GROUPS L, V45
[4]  
The GAP Group, 2017, GAP GROUP ALG PROGR
[5]  
Yu L., 2014, T I MAT MEKH URO RAN, V20, P305
[6]  
Zavarnitsine AV, 2009, SIB ELECTRON MATH RE, V6, P1