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


如何引用文章

全文:

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

详细

Let Γ be a distance regular graph with intersection array {35, 32, 1; 1, 4, 35} and let G = Aut(Γ) act transitively on the set of vertices of the graph Γ. It is shown that G is a {2, 3}-group.

作者简介

V. Bitkina

Khetagurov North Ossetian State University

编辑信件的主要联系方式.
Email: bviktoriyav@mail.ru
俄罗斯联邦, ul. Vatutina 46, Vladikavkaz, 362025

A. Makhnev

Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences

编辑信件的主要联系方式.
Email: makhnev@imm.uran.ru
俄罗斯联邦, ul. S. Kovalevskoi 16, Ekaterinburg, 620990

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media, LLC, part of Springer Nature, 2018