Pith. sign in

REVIEW 2 major objections 4 minor 61 references

Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers

T0 review · 2 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For every integer $m\geq1$, there is a connected tetravalent half-arc-transitive graph whose automorphism group is the alternating group $A_{2m+6}$ and whose vertex stabilizer is the nonabelian group $D_8^2\times C_2^m$; hence these…

desk verdict A genuinely new infinite family of tetravalent half-arc-transitive graphs with nonabelian vertex stabilizers, but the current text leaves key fixed-point calculations to its own missing appendix. read the letter →

arxiv 1908.09361 v4 pith:LOGKRCVR submitted 2019-08-25 math.CO

Binzhou Xia This is my paper · ORCID
classification math.CO MSC 20B2505C25
keywords half-arc-transitivegraphstetravalentvertexstabilizersnonabeliangroupsCayleynonnormalalternatingarc-transitivedigraphs
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves that tetravalent half-arc-transitive graphs can have nonabelian vertex stabilizers of arbitrarily large $2$-power order. For every positive integer $m$ it constructs a connected tetravalent half-arc-transitive graph $\Gamma_m$ whose full automorphism group is the alternating group $A_{2m+6}$ and whose vertex stabilizer is $D_8^2\times C_2^m$, a nonabelian group of order $2^{m+6}$. This answers a question open since 2015, when only six connected tetravalent half-arc-transitive graphs with nonabelian vertex stabilizers were known. The same graphs are nonnormal Cayley graphs on the alternating group $A_{2m+5}$ with trivial connection-set stabilizer, and their two orientation digraphs are $(m+6)$-arc-transitive and not self-reverse.

What carries the argument

The central object is the coset graph $\Gamma_m=\mathrm{Cos}(\mathrm{Alt}(H),R(H),R(H)\{xy,(xy)^{-1}\}R(H))$, where $H=D_8^2\times C_2^m$, $R(H)$ is the regular right-multiplication action of $H$, and $x,y,z$ are specific permutations of $H$ fixing the identity: $x$ is an automorphism of order $4$, $y$ is an involution, and $z=R(f)yR(f c d e_m^m)$ is a derived involution. The proof of connectivity shows $\langle R(H),xy\rangle=\mathrm{Alt}(H)$ by ruling out affine and product-action primitive groups, and the identity $|yz|=6$ forces the alternating cycles to have length $6$ while the intersection of the two alternating cycles through a vertex is just that vertex, giving attachment number $1$. The fixed-point counts of $yz$, $xyxz$, and their conjugates, recorded in Lemmas 3.7--3.10, are the load-bearing calculations that eliminate every potential automorphism of the Cayley graph and force $\mathrm{Aut}(\Gamma_m)=\mathrm{Alt}(H)$.

What would settle it

Compute the asserted fixed-point values for a small concrete case, say $m=1$ or $m=2$, directly from the definitions of $x,y,z$; if $|\mathrm{Fix}(xyxz)|\neq3$ for even $m$, or $|\mathrm{Fix}(yz)\cap\mathrm{Fix}(yz)^{xyzx^{-1}}|\neq2^{m+3}$, or any parity-dependent value in Lemma 3.9(d)--(g) differs, then the proof of Propositions 5.3 and 6.1 collapses and the theorem fails for that $m$.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is Theorem 1.2: for every $m\geq1$ there is a graph $\Gamma_m$ that is a connected nonnormal Cayley graph on the alternating group $A_{2m+5}$ with $\mathrm{Aut}(A_{2m+5},S)=1$, a loosely attached tetravalent half-arc-transitive graph of radius $6$, with $\mathrm{Aut}(\Gamma_m)\cong A_{2m+6}$, vertex stabilizer $D_8^2\times C_2^m$, and two orientation digraphs that are both $(m+6)$-arc-transitive and not self-reverse. The proof is not computer-assisted in the paper, though the paper notes that computations can verify the cases for small $m$.

Load-bearing premise

The load-bearing premise is that the fixed-point counts asserted in Lemmas 3.8 and 3.9 are correct, for example $|\mathrm{Fix}(yz)\cap\mathrm{Fix}(yz)^{xyzx^{-1}}|=2^{m+3}$ and the parity-dependent values in parts (d)--(g); the paper states these lemmas without proof and refers to its own extended version for the calculations, and if any one count is wrong the arguments excluding unwanted automorphisms in Propositions 5.3 and 6.1 break down.

Editorial extensions

If this is right

  • Together with the earlier examples with stabilizers $D_8$, $D_8\times C_2$ and $D_8^2$, the family answers Question 1.1: for every integer $s\geq3$ there is a connected tetravalent half-arc-transitive graph with nonabelian vertex stabilizer of order $2^s$.
  • Each $\Gamma_m$ is a nonnormal Cayley graph on the simple group $A_{2m+5}$ with $\mathrm{Aut}(A_{2m+5},S)=1$, giving an infinite family of connected tetravalent edge-transitive nonnormal Cayley graphs on nonabelian simple groups.
  • Since $\mathrm{Aut}(\Gamma_m)\cong A_{2m+6}$ is simple, each pair $(\Gamma_m,\mathrm{Aut}(\Gamma_m))$ is a quasiprimitive example in the normal-quotient analysis of tetravalent half-arc-transitive graphs.
  • The two orientation digraphs $D_1(\Gamma_m)$ and $D_2(\Gamma_m)$ are both $(m+6)$-arc-transitive and not self-reverse, so non-self-reverse digraphs occur with arbitrarily large arc-transitivity.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same double-coset construction may extend to other nonabelian $2$-groups $H$ that admit an automorphism of order $4$ and an involution $y$ with cycle structure matching the lemmas; testing the next-smallest candidates would show how rigid the $D_8^2\times C_2^m$ form is.
  • If the fixed-point counts in Lemmas 3.8 and 3.9 can be expressed as closed formulas in $m$, the proof would become self-contained and might explain why the vertex stabilizer is exactly a direct product of two copies of $D_8$ with an elementary abelian $2$-group.
  • The graphs show that the condition $\mathrm{Aut}(G,S)=1$ is far from sufficient for a Cayley graph on a simple group to be a graphical regular representation; studying the action of $\mathrm{Aut}(\Gamma_m)$ on the cosets of $R(G)$ may clarify exactly when normality fails.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper constructs, for every positive integer m, a connected tetravalent half-arc-transitive graph Γ_m with vertex stabilizer D_8^2 × C_2^m. The construction is a coset graph Cos(Alt(H), R(H), R(H){xy,(xy)^{-1}}R(H)), where H is a group of order 2^{m+6}. The author proves that Γ_m is a nonnormal Cayley graph on the alternating group A_{2m+6−1}, that Aut(Γ_m) ≅ A_{2m+6}, that Γ_m is loosely attached of radius 6, and that its two associated digraphs are (m+6)-arc-transitive and not self-reverse. This is claimed as an affirmative answer to Question 1.1 for all s ≥ 3 except s = 5, which is handled via a separate cover construction. The main proof is group-theoretic and not computer-assisted, but several technical lemmas are stated without proof and deferred to the author's own arXiv paper, which is the same paper under review.

Significance. If the construction and proof are correct, this is a substantial contribution. It resolves a long-standing open question, provides the first infinite family of connected tetravalent half-arc-transitive graphs with nonabelian vertex stabilizers of arbitrarily large 2-power order, and yields new examples relevant to nonnormal Cayley graphs on simple groups, quasiprimitive normal quotient analysis, and highly arc-transitive non-self-reverse digraphs. The explicit, parameterized construction is a strength, and several parts of the paper (e.g., the connectivity argument via fixed-point ratios and the normal quotient analysis in Proposition 6.1) are carefully reasoned. However, the paper currently lacks proofs of the key fixed-point lemmas, which are load-bearing for the automorphism group determination. Until those calculations are supplied in a verifiable form, the main theorem cannot be considered established.

major comments (2)
  1. [Section 3, Lemmas 3.8 and 3.9] Lemmas 3.8 and 3.9 are stated without proof, with the text saying 'it is tedious calculation and can be found in [55]'. Reference [55] is the arXiv identifier of this same paper. In the version under review no appendix or supplementary material containing these calculations is present. These fixed-point counts are load-bearing: Lemma 3.8 is used in Proposition 4.5 to rule out the affine case, and together with Lemma 3.9 it supplies the numerical contradictions in every case of Proposition 5.3, which establishes Aut(Alt(H)_1,S)=1. Proposition 6.1 then depends on this to force Aut(Γ_m)=Alt(H). Without an independent proof or a formally certified computation, Theorem 1.2(c) and (d) are not established.
  2. [Sections 3 and 4, Lemmas 3.4–3.7, 3.10, 4.1–4.4] The same self-referential deferral applies to Lemmas 3.4–3.7, 3.10, and 4.1–4.4, which are also said to be proved in [55]. These are not merely cosmetic: Lemma 3.7 supplies the fixed-point sets and the order |yz|=6 used in Proposition 4.5 and Proposition 5.3, Lemma 3.10 is used in Proposition 6.2 to show attachment number 1, and Lemmas 4.1–4.4 are essential in the connectivity proof. The paper should provide complete proofs of all these lemmas, or at minimum place the promised Magma verification code and its certified output in an appendix that is actually included in the manuscript.
minor comments (4)
  1. [Section 3, p. 9] The sentence 'The lemmas are stated below without proof, as it is tedious calculation and can be found in [55]' should be revised for grammar and, more importantly, should not point to the paper itself as the location of the proofs.
  2. [Section 6, Proposition 6.3] The text before Proposition 6.3 says that the proof 'is given by an anonymous referee'. This attribution is unusual and should be removed; the proof should be presented as an integral part of the paper without external authorship statements.
  3. [Section 3, Table of notation] The notation table is helpful but would be improved by explicitly stating that e_i is, by convention, the identity for i ≤ 0 before it is used in the action formulas; currently this convention appears only in the running text after the table.
  4. [Introduction, p. 3] The phrase 'gives the affirmative answer to Question 1.1 for s ≠ 5' is slightly imprecise because the construction covers s = m + 6, so for s = 6,7,... it gives infinitely many values; please clarify that the remaining case s = 5 is covered by the cited result of [52].

Circularity Check

1 steps flagged · score 4.0 of 10

The graph construction is explicit and not fitted, but the automorphism-group proof relies on Lemmas 3.8 and 3.9 whose proofs are delegated to a self-citation, the paper's own arXiv reference [55].

  1. self citation load bearing [Section 3, Lemmas 3.4–3.10 (especially Lemmas 3.8 and 3.9) and the reference list entry [55].]
    "The lemmas are stated below without proof, as it is tedious calculation and can be found in [55]. ... codes in Magma [5] are given in the appendix of [55]."

    Lemmas 3.8 and 3.9 provide the fixed-point counts used in Proposition 5.3 to eliminate every possible image of xy under a hypothetical automorphism of Alt(H)_1, and Proposition 5.3's conclusion Aut(Alt(H)_1, S) = 1 is then used in Proposition 6.1 to force Aut(Γ_m) = Alt(H) via [18, Theorem 1.1]. The proofs of these lemmas are not contained in the present text; they are referred to reference [55], which is the same arXiv paper by the same author. The Magma code promised in the introduction is said to be in the appendix of [55], but this version contains no such appendix.

full rationale

There is no construction-level circularity: Γ_m is defined explicitly for every m as a coset graph, no parameter is fitted to the target properties, and the claimed vertex stabilizer D8^2 × C2^m is built into H but is not assumed to be the full stabilizer. The proof aims to show Aut(Γ_m) = Alt(H) by contradiction, using external results such as [18, Theorem 1.1], [26, Theorem 1], [27, Theorem 1], and [29, Proposition 5.3.7], so the main theorem has substantial independent content. The only circularity-adjacent issue is the self-citation for the tedious fixed-point counts in Lemmas 3.8 and 3.9, which are used essentially in Propositions 5.3 and 6.1. Because those lemmas are stated without proof and referred to the paper's own arXiv reference [55], the verification chain for the automorphism group is not self-contained as written. This warrants a moderate score of 4: some load-bearing self-citation, but no prediction or derived quantity reduces to its input by construction.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

There are no fitted numerical parameters; m is the theorem's index, not a fitted constant. The construction rests on standard finite group and Cayley graph facts, on imported classification theorems from the literature, and on internally stated but unproved computational lemmas. The graph Gamma_m and permutations x, y, z are explicit constructions rather than postulated entities, so no invented entities are listed.

assumptions (6)
  • standard math Coset graph Cos(A,B,S) is connected if and only if A = <B,S>, and its valency is |S|/|B|; the group A acts by right multiplication as automorphisms.
    Used in Construction 3.3 and in the connectivity proof of Proposition 4.5.
  • standard math Godsil's normalizer formula N_Aut(Gamma)(R_G(G)) = R_G(G) x Aut(G,S).
    Equation (1) in Section 2.1, used in Proposition 6.1 to identify the normalizer of the regular subgroup.
  • domain assumption Guralnick and Magaard's classification of primitive permutation groups with fixed point ratio 1/2.
    Used in Proposition 4.5 to restrict the primitive group G after observing |Fix((yz)^3)|/|H| = 1/2.
  • domain assumption Guralnick's theorem on subgroups of prime power index in simple groups.
    Used in Proposition 4.5 to infer k = 1 and in Proposition 6.1 to infer Soc(X) = A_{2m+6}.
  • domain assumption Kleidman and Liebeck's Proposition 5.3.7 on degrees of irreducible subgroups of GL_n(2).
    Used in Proposition 6.1, case (ii), to lower bound log_2 |N| in terms of n.
  • ad hoc to paper The fixed point counts in Lemmas 3.8 and 3.9 and the element relations in Lemmas 3.4 through 3.7 hold for every m.
    These are stated without proof in Section 3, attributed to the paper's own appendix [55], and are used as black boxes in Propositions 4.5, 5.3, and 6.1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers." pith.science (2026). https://pith.science/paper/LOGKRCVR

@misc{pith2026190809361,
  author       = {Pith},
  title        = {Pith review of: Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LOGKRCVR}},
  note         = {Machine review of arXiv:1908.09361}
}
abstract

Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct half-arc-transitive graphs with prescribed vertex stabilizers. Until recently, there have been only six known connected tetravalent half-arc-transitive graphs with nonabelian vertex stabilizers, and the question whether there exists a connected tetravalent half-arc-transitive graph with nonabelian vertex stabilizer of order $2^s$ for every $s\geqslant3$ has been wide open. This question is answered in the affirmative in this paper via the construction of a connected tetravalent half-arc-transitive graph with vertex stabilizer $\mathrm{D}_8^2\times\mathrm{C}_2^m$ for each integer $m\geqslant1$, where $\mathrm{D}_8^2$ is the direct product of two copies of the dihedral group of order $8$ and $\mathrm{C}_2^m$ is the direct product of $m$ copies of the cyclic group of order $2$. The graphs constructed have surprisingly many significant properties in various contexts.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

61 extracted references · 61 canonical work pages

  1. [52]

    Constructing infinitely many half-arc-transitive covers of tetravalent graphs

    P. Spiga and B. Xia, Constructing infinitely many half-arc-trans itive covers of tetravalent graphs, https://arxiv.org/abs/1912.10695

    work page Pith review arXiv 1912

  2. [55]

    Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers

    B. Xia, Tetravalent half-arc-transitive graphs with unbounde d nonabelian vertex stabilizers, https://arxiv.org/abs/1908.09361

    work page Pith review arXiv 1908

  3. [1]

    J. A. Al-bar, A. N. Al-kenani, N. M. Muthana and C. E. Praeger, F inite edge-transitive oriented graphs of valency four with cyclic normal quotients, J. Algebraic Combin. 46 (2017), no. 1, 109–133

    work page 2017

  4. [2]

    J. A. Al-bar, A. N. Al-kenani, N. M. Muthana and C. E. Praeger, A normal quotient analysis for some families of oriented four-valent graphs, Ars Math. Contemp. 12 (2017), no. 2, 361–381

    work page 2017

  5. [3]

    J. A. Al-bar, A. N. Al-kenani, N. M. Muthana, C. E. Praeger and P . Spiga, Finite edge-transitive oriented graphs of valency four: a global approach, Electron. J. Combin. 23 (2016), no. 1, Paper 1.10, 23 pp

    work page 2016

  6. [4]

    Alspach, D

    B. Alspach, D. Maruˇ siˇ c, L. Nowitz, Constructing graphs which are 1 /2-transitive, J. Austral. Math. Soc. Ser. A 56 (1994), no. 3, 391–402

    work page 1994

  7. [5]

    Bosma, J

    W. Bosma, J. Cannon and C. Playoust, The magma algebra system I: The user language, J. Symbolic Comput., 24 (1997), no. 3–4, 235–265

    work page 1997

  8. [6]

    I. Z. Bouwer, Vertex and edge transitive, but not 1-transitive , graphs, Canad. Math. Bull. 13 (1970), 231–237

    work page 1970

Show all 61 references
  1. [7]

    J. Chen, B. Xia and J.-X. Zhou, An infinite family of cubic nonnormal Cayley graphs on nonabelian simple groups, Discrete Math. 341 (2018), no. 5, 1282–1293

    2018

  2. [8]

    Cheng and L

    H. Cheng and L. Cui, Tetravalent half-arc-transitive graphs of order p5, Appl. Math. Comput. 332 (2018), 506–518

    2018

  3. [9]

    M. D. E. Conder, Simple group actions on arc-transitive graphs w ith prescribed transitive local action, 2017 MATRIX annals , 327–335, MATRIX Book Ser., 2, Springer, Cham, 2019

    2017

  4. [10]

    Conder, P

    M. Conder, P. Lorimer and C. Praeger, Constructions for arc -transitive digraphs, J. Austral. Math. Soc. Ser. A 59 (1995), no. 1, 61–80

    1995

  5. [11]

    M. D. E. Conder and D. Maruˇ siˇ c, A tetravalent half-arc-transitive graph with non-abelian vertex stabilizer, J. Combin. Theory Ser. B 88 (2003), no. 1, 67–76

    2003

  6. [12]

    M. D. E. Conder and A. ˇZitnik, Half-arc-transitive graphs of arbitrary even valency grea ter than 2, European J. Combin. 54 (2016), 177–186

    2016

  7. [13]

    M. D. E. Conder, P. Potoˇ cnik and P. ˇSparl, Some recent discoveries about half-arc-transitive graphs, Ars Math. Contemp. 8 (2015), no. 1, 149–162

    2015

  8. [14]

    Dˇ zambi´ c and G

    A. Dˇ zambi´ c and G. A. Jones,p-adic Hurwitz groups, J. Algebra 379 (2013), 179–207

    2013

  9. [15]

    Delorme, Cayley digraphs and graphs, European J

    C. Delorme, Cayley digraphs and graphs, European J. Combin. 34 (2013), no. 8, 1307–1315

    2013

  10. [16]

    X. G. Fang, C. H. Li and M. Y. Xu, On edge-transitive Cayley gra phs of valency four, European J. Combin. 25 (2004), no. 7, 1107–1116

    2004

  11. [17]

    X. G. Fang, C. H. Li, J. Wang and M. Y. Xu, On cubic Cayley graphs of finite simple groups, Discrete Math. 244 (2002), no. 1–3, 67–75

    2002

  12. [18]

    X. G. Fang, C. E. Praeger and J. Wang, On the automorphism gr oups of Cayley graphs of finite simple groups, J. London Math. Soc. (2) 66 (2002), no. 3, 563–578

    2002

  13. [19]

    Feng, Z.-P

    Y.-Q. Feng, Z.-P. Lu and M.-Y. Xu, Automorphism groups of Cayle y digraphs, in Application of Group Theory to Combinatorics , edited by J. Koolen, J. H. Kwak and M. Y. Xu, CRC Press, Taylor & Francis Group, London, 2008. pp. 13–25

    2008

  14. [20]

    J. B. Fawcett, M. Giudici, C. H. Li, C. E. Praeger, G. Royle and G. Verret, Primitive permutation groups with a suborbit of length 5 and vertex-primitive graphs of va lency 5, J. Combin. Theory Ser. A 157 (2018), 247–266

    2018

  15. [21]

    Gardiner and C

    A. Gardiner and C. E. Praeger, On 4-valent symmetric graphs, European J. Combin. 15 (1994), no. 4, 375–381

    1994

  16. [22]

    C. D. Godsil, On the full automorphism group of a graph, Combinatorica 1 (1981), no. 3, 243–256

    1981

  17. [23]

    C. D. Godsil, The automorphism group of some cubic Cayley graph s, European J. Combin. 4 (1983), no. 1, 25–32

    1983

  18. [24]

    Giudici and B

    M. Giudici and B. Xia, Vertex-quasiprimitive 2-arc-transitive dig raphs, Ars Math. Contemp. 14 (2018), no. 1, 67–82

    2018

  19. [25]

    S.-T. Guo, H. Hou, Hailong and Y. Xu, Hexavalent half-arc-tran sitive graphs of order 9 p, Discrete Math. 342 (2019), no. 6, 1802–1811

    2019

  20. [26]

    R. M. Guralnick, Subgroups of prime power index in a simple group, J. Algebra 81 (1983), no. 2, 304–311. TETRA V ALENT HALF-ARC-TRANSITIVE GRAPHS 19

    1983

  21. [27]

    Guralnick and K

    R. Guralnick and K. Magaard, On the minimal degree of a primitive p ermutation group, J. Algebra 207 (1998), no. 1, 127–145

    1998

  22. [28]

    Jajcay, ˇS

    R. Jajcay, ˇS. Miklaviˇ c, P.ˇSparl and G. Vasiljevi´ c, On certain edge-transitive bicirculants,Electron. J. Combin. 26 (2019), no. 2, Paper 2.6, 28 pp

    2019

  23. [29]

    P. B. Kleidman and M. W. Liebeck, The subgroup structure of the finite classical groups , Cam- bridge University Press, Cambridge, 1990

    1990

  24. [30]

    C. H. Li, Z. P. Lu and G. X. Wang, The vertex-transitive and edg e-transitive tetravalent graphs of square-free order, J. Algebraic Combin. 42 (2015), no. 1, 25–50

    2015

  25. [31]

    C. H. Li and H.-S. Sim, The graphical regular representations o f finite metacyclic p-groups, Eu- ropean J. Combin. 21 (2000), no. 7, 917–925

    2000

  26. [32]

    Malniˇ c and D

    A. Malniˇ c and D. Maruˇ siˇ c, Constructing 4-valent1 2 -transitive graphs with a nonsolvable automor- phism group, J. Combin. Theory Ser. B 75 (1999), no. 1, 46–55

    1999

  27. [33]

    Maruˇ siˇ c, Recent developments in half-transitive graphs, Discrete Math

    D. Maruˇ siˇ c, Recent developments in half-transitive graphs, Discrete Math. 182 (1998), no. 1–3, 219–231

    1998

  28. [34]

    Maruˇ siˇ c, Half-transitive group actions on finite graphs of valency 4, J

    D. Maruˇ siˇ c, Half-transitive group actions on finite graphs of valency 4, J. Combin. Theory Ser. B 73 (1998), no. 1, 41–76

    1998

  29. [35]

    Maruˇ siˇ c, Quartic half-arc-transitive graphs with large v ertex stabilizers, Discrete Math

    D. Maruˇ siˇ c, Quartic half-arc-transitive graphs with large v ertex stabilizers, Discrete Math. 299 (2005), no. 1-3, 180–193

    2005

  30. [36]

    Maruˇ siˇ c and R

    D. Maruˇ siˇ c and R. Nedela, Maps and half-transitive graphs of valency 4, European J. Combin. 19 (1998), no. 3, 345–354

    1998

  31. [37]

    Maruˇ siˇ c and R

    D. Maruˇ siˇ c and R. Nedela, On the point stabilizers of transitiv e groups with non-self-paired suborbits of length 2, J. Group Theory 4 (2001), no. 1, 19–43

    2001

  32. [38]

    Maruˇ siˇ c and C

    D. Maruˇ siˇ c and C. E. Praeger, Tetravalent graphs admitting half-transitive group actions: alter- nating cycles, J. Combin. Theory Ser. B 75 (1999), no. 2, 188–205

    1999

  33. [39]

    Maruˇ siˇ c and A

    D. Maruˇ siˇ c and A. O. Waller, Half-transitive graphs of valenc y 4 with prescribed attachment numbers, J. Graph Theory 34 (2000), no. 1, 89–99

    2000

  34. [40]

    Maruˇ siˇ c and M.-Y

    D. Maruˇ siˇ c and M.-Y. Xu, A 1 2 -transitive graph of valency 4 with a nonsolvable group of auto- morphisms, J. Graph Theory 25 (1997), no. 2, 133–138

    1997

  35. [41]

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

    1993

  36. [42]

    Potoˇ cnik and R

    P. Potoˇ cnik and R. Poˇ zar, Smallest tetravalent half-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8, J. Combin. Theory Ser. A 145 (2017), 172–183

    2017

  37. [43]

    Potoˇ cnik and P

    P. Potoˇ cnik and P. ˇSparl, On the radius and the attachment number of tetravalent ha lf-arc- transitive graphs, Discrete Math. 340 (2017), no. 12, 2967–2971

    2017

  38. [44]

    Potoˇ cnik and P

    P. Potoˇ cnik and P. Spiga, Lifting a prescribed group of automo rphisms of graphs, Proc. Amer. Math. Soc. 147 (2019), no. 9, 3787–3796

    2019

  39. [45]

    Ramos Rivera and P

    A. Ramos Rivera and P. ˇSparl, The classification of half-arc-transitive generalizations of B ouwer graphs, European J. Combin. 64 (2017), 88–112

    2017

  40. [46]

    Ramos Rivera and P

    A. Ramos Rivera and P. ˇSparl, New structural results on tetravalent half-arc-transitiv e graphs, J. Combin. Theory Ser. B 135 (2019), 256–278

    2019

  41. [47]

    ˇSajna, Half-transitivity of some metacirculants, Discrete Math

    M. ˇSajna, Half-transitivity of some metacirculants, Discrete Math. 185 (1998), no. 1–3, 117–136

    1998

  42. [48]

    ˇSparl, A classification of tightly attached half-arc-transitive grap hs of valency 4, J

    P. ˇSparl, A classification of tightly attached half-arc-transitive grap hs of valency 4, J. Combin. Theory Ser. B 98 (2008), no. 5, 1076–1108

    2008

  43. [49]

    Spiga, Constructing half-arc-transitive graphs of valency four with prescribed vertex stabilizers, Graphs Combin

    P. Spiga, Constructing half-arc-transitive graphs of valency four with prescribed vertex stabilizers, Graphs Combin. 32 (2016), no. 5, 2135–2144

    2016

  44. [50]

    Spiga, Cubic graphical regular representations of finite non -abelian simple groups, Comm

    P. Spiga, Cubic graphical regular representations of finite non -abelian simple groups, Comm. Algebra, 46 (2018), no. 6, 2440–2450

    2018

  45. [51]

    Spiga and G

    P. Spiga and G. Verret, On the order of vertex-stabilisers in ve rtex-transitive graphs with local group C p × Cp or C p wr C2, J. Algebra, 448 (2016), 174–209

    2016

  46. [53]

    W. T. Tutte, Connectivity in graphs , University of Toronto Press, Toronto, 1966

    1966

  47. [54]

    Wang and Y.-Q

    X. Wang and Y.-Q. Feng, Tetravalent half-edge-transitive gra phs and non-normal Cayley graphs, J. Graph Theory 70 (2012), no. 2, 197–213. 20 XIA

    2012

  48. [56]

    Xu and S

    M. Xu and S. Xu, Symmetry properties of Cayley graphs of small valencies on the alternating group A5, Sci. China Ser. A 47 (2004), no. 4, 593–604

    2004

  49. [57]

    S. J. Xu, X. G. Fang, J. Wang and M. Y. Xu, On cubic s-arc transitive Cayley graphs of finite simple groups, European J. Combin. 26 (2005), no. 1, 133–143

    2005

  50. [58]

    S. J. Xu, X. G. Fang, J. Wang and M. Y. Xu, 5-arc transitive cub ic Cayley graphs on finite simple groups, European J. Combin. 28 (2007), no. 3, 1023–1036

    2007

  51. [59]

    Zhang and X

    C. Zhang and X. G. Fang, A note on the automorphism groups of cubic Cayley graphs of finite simple groups, Discrete Math. 310 (2010), no. 21, 3030–3032

    2010

  52. [60]

    Zhang and J

    M. Zhang and J. Zhou, Automorphism groups of Bouwer graphs , Algebra Colloq. 25 (2018), no. 3, 493–508

    2018

  53. [61]

    Zhou and Y.-Q

    J.-X. Zhou and Y.-Q. Feng, The automorphisms of bi-Cayley grap hs J. Combin. Theory Ser. B 116 (2016), 504–532. School of Mathematics and Statistics, The University of Mel bourne, Parkville, VIC 3010, Australia Email address : binzhoux@unimelb.edu.au

    2016

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.