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


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Possible prime-order automorphisms and their fixed-point subgraphs are found for a hypothetical distance-regular graph with intersection array {39, 36, 1; 1, 2, 39}. It is shownthat 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.

作者简介

I. Belousov

Krasovskii Institute of Mathematics and Mechanics; Ural Federal University

编辑信件的主要联系方式.
Email: i_belousov@mail.ru
俄罗斯联邦, Yekaterinburg, 620990; Yekaterinburg, 620002

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2016