On automorphisms of a distance-regular graph with intersection array {39, 36, 1; 1, 2, 39}

被引：0

作者：

Belousov, I. N.

机构：

来源：

TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN | 2015年 / 21卷 / 03期

关键词：

distance-regular graph; graph automorphism;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Possible prime-order automorphisms and fixed-point subgraphs are found for a hypothetical distance-regular graph with intersection array {39, 36, 1; 1,2, 39}. It is shown that graphs with intersection arrays {15, 12, 1; 1,2, 15}, {35, 32, 1; 1,2, 35}, and {39, 36, 1; 1, 2, 39} are not vertex-symmetric.

引用

页码：54 / 62

页数：9