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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

I. N. Belousov

Krasovskii Institute of Mathematics and Mechanics; Ural Federal University

Author for correspondence.
Email: i_belousov@mail.ru
Russian Federation, Yekaterinburg, 620990; Yekaterinburg, 620002

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Pleiades Publishing, Ltd.