2019Proceedings of the Steklov Institute of MathematicsRequires access

Automorphisms of an AT4(4, 4, 2)-Graph and of the Corresponding Strongly Regular Graphs

Константин С. Ефимов

Open publisher page 1 citations

Abstract

Makhnev, Paduchikh, and Khamgokova gave a classification of distance-regular locally GQ (5, 3)-graphs. In particular, there arises an AT 4(4, 4, 2)-graph on 644 vertices with intersection array {96, 75, 16, 1; 1, 16, 75, 96}. The same authors proved that an AT 4(4, 4, 2)-graph is not a locally GQ (5, 3)-graph. However, the existence of an AT 4(4, 4, 2)-graph that is a locally pseudo- GQ (5, 3)-graph is unknown. The antipodal quotient of an AT 4(4, 4, 2)-graph is a strongly regular graph with parameters (322, 96, 20, 32). These two graphs are locally pseudo- GQ (5, 3)-graphs. We find their possible automorphisms. It turns out that the automorphism group of a distance-regular graph with intersection array {96, 75, 16, 1; 1, 16, 75, 96} acts intransitively on the set of its antipodal classes.

About this research paper

What this paper is about

Makhnev, Paduchikh, and Khamgokova gave a classification of distance-regular locally GQ (5, 3)-graphs. In particular, there arises an AT 4(4, 4, 2)-graph on 644 vertices with intersection array {96, 75, 16, 1; 1, 16, 75, 96}. The same authors proved that an AT 4(4, 4, 2)-graph is not a locally GQ (5, 3)-graph. However, the existence of an AT 4(4, 4, 2)-graph that is a locally pseudo- GQ (5, 3)-graph is unknown. The antipodal quotient of an AT 4(4, 4, 2)-graph is a strongly regular graph with parameters (322, 96, 20, 32). These two graphs are locally pseudo- GQ (5, 3)-graphs. We find their possible automorphisms. It turns out that the automorphism group of a distance-regular graph with intersection array {96, 75, 16, 1; 1, 16, 75, 96} acts intransitively on the set of its antipodal classes.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Makhnev, Paduchikh, and Khamgokova gave a classification of distance-regular locally GQ (5, 3)-graphs. In particular, there arises an AT 4(4, 4, 2)-graph on 644 vertices with intersection array {96, 75, 16, 1; 1, 16, 75, 96}. The same authors proved that an AT 4(4, 4, 2)-graph is not a locally GQ (5, 3)-graph. However, the existence of an AT 4(4, 4, 2)-graph that is a locally pseudo- GQ (5, 3)-graph is unknown. The antipodal quotient of an AT 4(4, 4, 2)-graph is a strongly regular graph with parameters (322, 96, 20, 32). These two graphs are locally pseudo- GQ (5, 3)-graphs. We find their possible automorphisms. It turns out that the automorphism group of a distance-regular graph with intersection array {96, 75, 16, 1; 1, 16, 75, 96} acts intransitively on the set of its antipodal classes.

Key concepts: Automorphism, Graph, Mathematics, Combinatorics

Related papers

Back to paper searchBrowse research topicsOriginal source
Automorphisms of an AT4(4, 4, 2)-Graph and of the Corresponding Strongly Regular Graphs — Research Paper | ScholarLens