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

详细信息    查看全文

• 作者：I. N. Belousov
• 关键词：distance ; regular graph ; graph automorphism
• 刊名：Proceedings of the Steklov Institute of Mathematics
• 出版年：2016
• 出版时间：December 2016
• 年：2016
• 卷：295
• 期：1-supp
• 页码：28-37
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics, general;
• 出版者：Pleiades Publishing
• ISSN：1531-8605
• 卷排序：295

文摘

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.