On 2-arc-transitive Graphs of Product Action Type

Zaiping Lu

Frontiers of Mathematics ›› 2026, Vol. 21 ›› Issue (2) : 319 -340.

PDF
Frontiers of Mathematics ›› 2026, Vol. 21 ›› Issue (2) :319 -340. DOI: 10.1007/s11464-024-0070-0
Research Article
research-article
On 2-arc-transitive Graphs of Product Action Type
Author information +
History +
PDF

Abstract

In this paper, we discuss the structural information about 2-arc-transitive (non-bipartite and bipartite) graphs of product action type. It is proved that a 2-arc-transitive graph of product action type requires certain restrictions on either the vertex-stabilizers or the valency. Based on the existence of some equidistant linear codes, a construction is given for 2-arc-transitive graphs of non-diagonal product action type, which produces several families of such graphs. Besides, a nontrivial construction is given for 2-arc-transitive bipartite graphs of diagonal product action type.

Keywords

2-arc-transitive graph / locally primitive graph / quasiprimitive group / product action / equidistant linear code / 05C25 / 05E18 / 20B25 / 94B05

Cite this article

Download citation ▾
Zaiping Lu. On 2-arc-transitive Graphs of Product Action Type. Frontiers of Mathematics, 2026, 21(2): 319-340 DOI:10.1007/s11464-024-0070-0

登录浏览全文

4963

注册一个新账户 忘记密码

References

[1]

Aschbacher M. Finite Group Theory. 1986, Cambridge, Cambridge University Press10

[2]

Baddeley R. Two-arc transitive graphs and twisted wreath products. J. Algebraic Combin.. 1993, 2(3): 215-237.

[3]

Biggs NL. Algebraic Graph Theory. 1974, Cambridge, Cambridge University Press. 67

[4]

Cameron PJ, Maimani HR, Omidi GR, Tayfeh-Rezaie B. 3-Designs from PSL(2,q). Discrete Math.. 2006, 306(23): 3063-3073.

[5]

Conway JH, Curtis RT, Norton SP, Parker RA, Wilson RA. ATLAS\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\mathbb A}{\mathbb T}{\mathbb L}{\mathbb A}{\mathbb S}$$\end{document} of Finite Groups. 1985, Eynsham, Oxford University Press

[6]

Dixon DJ, Mortimer B. Permutation Groups. 1996, New York, Springer-Verlag163

[7]

Fang XG, Praeger CE. Finite two-arc transitive graphs admitting a Suzuki simple group. Comm. Algebra. 1999, 27(8): 3727-3754.

[8]

Fang XG, Praeger CE. Finite two-arc transitive graphs admitting a Ree simple group. Comm. Algebra. 1999, 27(8): 3755-3769.

[9]

Giudici M, Li CH, Praeger CE. Analysing finite locally s-arc transitive graphs. Trans. Amer. Math. Soc.. 2004, 356(1): 291-317.

[10]

Hassani A, Nochefranca LR, Praeger CE. Two-arc transitive graphs admitting a two-dimensional projective linear group. J. Group Theory. 1999, 2(4): 335-353.

[11]

Hirschfeld JWP. Projective Geometries over Finite Fields. 1998SecondNew York, The Clarendon Press.

[12]

Huppert B. Endliche Gruppen I. 1967, Berlin, New York, Springer-Verlag.

[13]

Ivanov AA, Praeger CE. On finite affine 2-arc transitive graph. European J. Combin.. 1993, 14(5): 421-444.

[14]

Li CH, Lu ZP, Wang GX. Arc-transitive graphs of square-free order and small valency. Discrete Math.. 2016, 339(12): 2907-2918.

[15]

Li CH, Seress Á. Constructions of quasiprimitive two-arc transitive graphs of product action type. Finite Geometries, Groups, and Computation. 2006, Berlin, Walter de Gruyter115123.

[16]

Liebeck MW, Praeger CE, Saxl J. A classification of the maximal subgroups of the finite alternating group and symmetric groups. J. Algebra. 1987, 111(2): 365-383.

[17]

Lu ZP, Song RY. On basic 2-arc-transitive graphs. J. Algebraic Combin.. 2023, 58(4): 1081-1093.

[18]

Praeger CE. An O’Nan–Scott theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs. J. London Math. Soc. (2). 1993, 47(2): 227-239.

[19]

Praeger CE. On a reduction theorem for finite, bipartite 2-arc-transitive graphs. Australas. J. Combin.. 1993, 7: 21-36

[20]

Praeger CE. Finite quasiprimitive graphs. Surveys in Combinatorics. 1997, Cambridge, Cambridge University Press6585241

[21]

Praeger CE, Schneider C. Permutation Groups and Cartesian Decompositions. 2018, Cambridge, Cambridge University Press. 449

[22]

The GAP Group. GAP—Groups, Algorithms, and Programming, Version 4.14.0. 2024

[23]

Weiss R. s-transitive graphs. Algebraic Methods in Graph Theory, Vol. I, II (Szeged, 1978). 1981, Amsterdam–New York, North-Holland82784725

[24]

Zsigmondy K. Zur Theorie der Potenzreste. Monatsh. Math. Phys.. 1892, 3(1): 265-284.

RIGHTS & PERMISSIONS

Peking University

PDF

217

Accesses

0

Citation

Detail

Sections
Recommended

/