RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive

Sib. Èlektron. Mat. Izv., 2017 Volume 14, Pages 1198–1206 (Mi semr860)

This article is cited in 1 paper

Discrete mathematics and mathematical cybernetics

Vertex-transitive semi-triangular graphs with $\mu=7$

N. D. Zyulyarkinaa, A. A. Makhnevb, D. V. Paduchikhb, M. M. Khamgokovac

a South Ural State University, Lenina Avenue, 76, 454080, Chelyabinsk, Russia
b Krasovskii Institute of Mathematics and Mechanics, S.Kovalevskaya Str., 16, 620990, Yekaterinburg, Russia
c Kabardino-Balkar State University, Chernyshevskogo st., 173, 360004, Nal’chik, Russia

Abstract: A semi-triangular Higman graph is a strongly regular graph with $v={m \choose 2}$, $k=2(m-2)$. The semi-triangular Higman graph with $\mu=7$ is pseudogeometric for $GQ(14,6)$. Previously, possible orders automorphisms of a pseudogeometric graph for $GQ(14,6)$ were found, and the structure subgraphs of fixed points of these automorphisms was determined. In this work we found a structure of nonsolvable group $G$ of automorphisms of a pseudogeometric graph for $GQ(14,6)$, acting transitively on the set of vertices of the graph.

Keywords: strongly regular graph, automophism.

UDC: 519.17

MSC: 06B20

Received October 6, 2017, published November 27, 2017

DOI: 10.17377/semi.2017.14.101



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025