Automorphism Groups of Small Distance-Regular Graphs

被引：0
|
作者：
I. N. Belousov
A. A. Makhnev
机构：
[1] Russian Academy of Sciences,Krasovskii Institute of Mathematics and Mechanics, Ural Branch
[2] Russian Academy of Sciences,Krasovskii Institute of Mathematics and Mechanics, Ural Branch
来源：
Algebra and Logic | 2017年 / 56卷
关键词：
distance-regular graph; locally cyclic graph; intersection array; automorphism group;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We consider undirected graphs without loops and multiple edges. Previously, V. P. Burichenko and A. A. Makhnev [1] found intersection arrays of distance-regular locally cyclic graphs with the number of vertices at most 1000. It is shown that the automorphism group of a graph with intersection array {15, 12, 1; 1, 2, 15}, {35, 32, 1; 1, 2, 35}, {39, 36, 1; 1, 2, 39}, or {42, 39, 1; 1, 3, 42} (such a graph enters the above-mentioned list) acts intransitively on the set of its vertices.
引用
收藏
页码：261 / 268
页数：7
相关论文
共 50 条
12345