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

Sib. Èlektron. Mat. Izv., 2015 Volume 12, Pages 130–149 (Mi semr575)

Mathematical logic, algebra and number theory

Limit graphs of degree less than 24 for minimal vertex-primitive graphs of HA-type

K. V. Kostousov

Institute of Mathematics and Mechanics UrB RAS, S. Kovalevskaya str., 16, 620990, Ekaterinburg, Russia

Abstract: A primitive permutation group is called a group of HA-type, if it contains regular abelian normal subgroup. A finite connected graph $\Gamma$ is called a minimal vertex-primitive graph of HA-type, if there exists a vertex-primitive group $G$ of automorphisms of $\Gamma$ of HA-type, such that $\Gamma$ has a minimal degree among all connected graphs $\Delta$, with $V(\Delta)=V(\Gamma)$ and $G\leq \mathrm{Aut}\,(\Delta)$. For the class of minimal vertex-primitive graphs of HA-type we find all limit graphs of degree less than 24 (it is shown that there are 23 such graphs). In the previous paper the author proved that there are infinitely many such limit graphs of degree 24.

Keywords: vertex-primitive graph, limit graph, Cayley graph, free abelian group.

UDC: 512.54+519.17

MSC: 05C25

Received January 12, 2015, published February 26, 2015

Language: English

DOI: 10.17377/semi.2015.12.012



© Steklov Math. Inst. of RAS, 2026