Abstract In 1991, Alspach, Marusic, and Nowitz proved that there are infinitely many 12-transitive graphs of degree 4. Their graphs were found among metacirculants M(α; m, n), which have vertex set {vji: i ϵ Zm, j ϵ Zn} and edge set {vji vj+δαii+1: i ϵ Zn, δ ϵ {− 1, 1}} with the additional condition that α ∈ Z n ∗ has order m or 2m. Examining only the cases when both m and n are odd, they showed that the graphs M(α; 3, n) are 12-transitive when n ⩾ 9 and gave a sufficient condition for M(α; m, n) to be 12-transitive when m is composite and n is prime. In this paper, we give a simple generalization of this condition. We also show that the graphs M(α; 2, n) are arc-transitive. Then we examine the graphs M(α; 4, n). We prove that they are arc-transitive when the order of α is 4 with α2 ≡ −1 (mod n) and 12-transitive when either the order of α is 8 or the order of α is 4 with α2 ≢ −1 (mod n) and n is not a multiple of 4.
[1]
Eric S. Lander,et al.
AN ALGEBRAIC APPROACH
,
1983
.
[2]
I. Bouwer.
Vertex and Edge Transitive, but not 1-Transitive, Graphs
,
1970,
Canadian Mathematical Bulletin.
[3]
Brian Alspach,et al.
A Construction for Vertex-Transitive Graphs
,
1982,
Canadian Journal of Mathematics.
[4]
W. T. Tutte.
Connectivity in graphs
,
1966
.
[5]
B. Alspach,et al.
Constructing graphs which are ½-transitive
,
1994
.
[6]
Mingyao Xu.
Half-Transitive Graphs of Prime-Cube Order
,
1992
.
[7]
Dragan Marusic,et al.
Half-Transitive Group Actions on Finite Graphs of Valency 4
,
1998,
J. Comb. Theory, Ser. B.
[8]
David Burton.
Elementary Number Theory
,
1976
.
[9]
Derek F. Holt,et al.
A graph which is edge transitive but not arc transitive
,
1981,
J. Graph Theory.