TY - JOUR
T1 - A characterisation of edge-affine 2-arc-transitive covers of K2n,2n
AU - Hawtin, Daniel R.
AU - Praeger, Cheryl E.
AU - Zhou, Jin Xin
N1 - Publisher Copyright:
© 2024 Elsevier Inc.
PY - 2024/10
Y1 - 2024/10
N2 - The family of finite 2-arc-transitive graphs of a given valency is closed under forming non-trivial normal quotients, and graphs in this family having no non-trivial normal quotient are called ‘basic’. To date, the vast majority of work in the literature has focused on classifying these ‘basic’ graphs. By contrast we give here a characterisation of the normal covers of the ‘basic’ 2-arc-transitive graphs K2n,2n for n≥2. The characterisation identified the special role of graphs associated with a subgroup of automorphisms called an n-dimensional mixed dihedral group. This is a group H with two subgroups X and Y, each elementary abelian of order 2n, such that X∩Y=1, H is generated by X∪Y, and H/H′≅X×Y. Our characterisation shows that each 2-arc-transitive normal cover of K2n,2n is either itself a Cayley graph, or is the line graph of a Cayley graph of an n-dimensional mixed dihedral group. In the latter case, we show that the 2-arc-transitive group acting on the normal cover of K2n,2n induces an edge-affine action on K2n,2n (and we show that such actions are one of just four possible types of 2-arc-transitive actions on K2n,2n). As a partial converse, we provide a graph theoretic characterisation of n-dimensional mixed dihedral groups, and finally, for each n≥2, we give an explicit construction of an n-dimensional mixed dihedral group which is a 2-group of order 2n2+2n, and a corresponding 2-arc-transitive normal cover of 2-power order of K2n,2n. Note that these results partially address a problem proposed by Caiheng Li concerning normal covers of prime power order of the ‘basic’ 2-arc-transitive graphs.
AB - The family of finite 2-arc-transitive graphs of a given valency is closed under forming non-trivial normal quotients, and graphs in this family having no non-trivial normal quotient are called ‘basic’. To date, the vast majority of work in the literature has focused on classifying these ‘basic’ graphs. By contrast we give here a characterisation of the normal covers of the ‘basic’ 2-arc-transitive graphs K2n,2n for n≥2. The characterisation identified the special role of graphs associated with a subgroup of automorphisms called an n-dimensional mixed dihedral group. This is a group H with two subgroups X and Y, each elementary abelian of order 2n, such that X∩Y=1, H is generated by X∪Y, and H/H′≅X×Y. Our characterisation shows that each 2-arc-transitive normal cover of K2n,2n is either itself a Cayley graph, or is the line graph of a Cayley graph of an n-dimensional mixed dihedral group. In the latter case, we show that the 2-arc-transitive group acting on the normal cover of K2n,2n induces an edge-affine action on K2n,2n (and we show that such actions are one of just four possible types of 2-arc-transitive actions on K2n,2n). As a partial converse, we provide a graph theoretic characterisation of n-dimensional mixed dihedral groups, and finally, for each n≥2, we give an explicit construction of an n-dimensional mixed dihedral group which is a 2-group of order 2n2+2n, and a corresponding 2-arc-transitive normal cover of 2-power order of K2n,2n. Note that these results partially address a problem proposed by Caiheng Li concerning normal covers of prime power order of the ‘basic’ 2-arc-transitive graphs.
KW - 2-arc-transitive
KW - Cayley graph
KW - Edge-transitive
KW - Mixed dihedral groups
KW - Normal cover
UR - http://www.scopus.com/inward/record.url?scp=85194313328&partnerID=8YFLogxK
U2 - 10.1016/j.jcta.2024.105919
DO - 10.1016/j.jcta.2024.105919
M3 - Article
AN - SCOPUS:85194313328
SN - 0097-3165
VL - 207
JO - Journal of Combinatorial Theory. Series A
JF - Journal of Combinatorial Theory. Series A
M1 - 105919
ER -