pith. sign in

arxiv: 1906.09367 · v1 · pith:DKWJMSC2new · submitted 2019-06-22 · 🧮 math.CO

Trivalent dihedrants and bi-dihedrants

Mi-Mi Zhang , Jin-Xin Zhou This is my paper

Pith reviewed 2026-05-25 18:43 UTC · model grok-4.3

classification 🧮 math.CO
keywords dihedrantsbi-dihedrantstrivalent graphsCayley graphsvertex-transitivearc-transitivedihedral groupsbi-Cayley graphs
0
0 comments X

The pith

Trivalent non-arc-transitive dihedrants are classified into explicit families using group structure.

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

The paper establishes a classification of all trivalent non-arc-transitive dihedrants by leveraging the structure of dihedral groups and prior results on arc-transitive cases. This classification is then applied to obtain a complete list of trivalent vertex-transitive non-Cayley bi-dihedrants. A sympathetic reader would care because these objects represent symmetric graphs constructed from dihedral groups, which are fundamental in understanding group actions on graphs. The work completes an earlier study of bi-dihedrants.

Core claim

The authors present a classification of trivalent non-arc-transitive dihedrants on dihedral groups. Using this result, they give a complete classification of trivalent vertex-transitive non-Cayley bi-dihedrants, thereby finishing the study of trivalent bi-dihedrants.

What carries the argument

Dihedrant, a Cayley graph on a dihedral group, and bi-dihedrant, its bi-Cayley counterpart; the distinction between arc-transitive and non-arc-transitive cases determines the families.

If this is right

  • Every trivalent non-arc-transitive dihedrant belongs to one of the classified families.
  • The full set of trivalent vertex-transitive non-Cayley bi-dihedrants is now known.
  • The classification generalizes a theorem from an earlier paper on bi-Cayley graphs.
  • Trivalent bi-dihedrants are completely classified as either Cayley or non-Cayley.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar classification techniques could apply to graphs of higher degree or on other groups like generalized dihedral groups.
  • The explicit lists may aid in computational enumeration of small symmetric graphs.
  • Questions arise about whether non-arc-transitive cases dominate for larger orders.

Load-bearing premise

The earlier classifications of arc-transitive dihedrants and dihedrants of restricted orders are complete and can be combined with the structural analysis of dihedral groups.

What would settle it

A concrete counterexample would be a trivalent non-arc-transitive dihedrant whose parameters or automorphism group action does not fit any of the described families in the classification.

Figures

Figures reproduced from arXiv: 1906.09367 by Jin-Xin Zhou, Mi-Mi Zhang.

Figure 1
Figure 1. Figure 1: The cross ladder graph CL4m study of automorphisms of trivalent graphs (see, for example, [5, 21, 25]). Motivated by the above mentioned facts, we shall focus on trivalent non-arc-transitive dihedrants. Our first theorem generalizes the results in [22, 25] to all trivalent dihedrants. Theorem 1.1 Let Σ = Cay(H, S) be a connected trivalent Cayley graph, where H = ha, b | a n = b 2 = 1, bab = a −1 i(n ≥ 3). … view at source ↗
Figure 2
Figure 2. Figure 2: The multi-cross ladder graph MCL20,2 Note that the multi-cross ladder graph MCL4m,2 is just the graph given in [23, Def￾inition 7]. From [7, Proposition 3.3] we know that every MCL4m,2 is vertex-transitive. 2 [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The sketch graph of ΓB Vi = {B0 i , B1 i } with i ∈ Z2n 2t is a block of imprimitivity of G/KB acting on V (ΓB). So every B0 i ∪ B1 i with i ∈ Z2n 2t is a block of imprimitivity of G acting on V (Γ). Let E be the kernel of G acting on the block system Λ = {B0 i ∪ B1 i | i ∈ Z2n 2t }. Then G/E ∼= Dn t acts regularly on Λ. Clearly, R(H) is also transitive on Ω, so G/E = R(H)E/E. By Lemma 7.12, T is a the ker… view at source ↗
read the original abstract

A Cayley (resp. bi-Cayley) graph on a dihedral group is called a {\em dihedrant} (resp. {\em bi-dihedrant}). In 2000, a classification of trivalent arc-transitive dihedrants was given by Maru\v si\v c and Pisanski, and several years later, trivalent non-arc-transitive dihedrants of order $4p$ or $8p$ $(p$ a prime) were classified by Feng et al. As a generalization of these results, our first result presents a classification of trivalent non-arc-transitive dihedrants. Using this, a complete classification of trivalent vertex-transitive non-Cayley bi-dihedrants is given, thus completing the study of trivalent bi-dihedrants initiated in our previous paper [Discrete Math. 340 (2017) 1757--1772]. As a by-product, we generalize a theorem in [The Electronic Journal of Combinatorics 19 (2012) $\#$P53].

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript presents a classification of all trivalent non-arc-transitive dihedrants (Cayley graphs on dihedral groups), generalizing the arc-transitive classification of Marušič and Pisanski (2000) and the order-restricted results of Feng et al. It then derives from this a complete classification of trivalent vertex-transitive non-Cayley bi-dihedrants, completing the authors' 2017 study, and as a by-product generalizes a 2012 theorem from The Electronic Journal of Combinatorics.

Significance. If the classification is correct, the work completes the enumeration of trivalent bi-dihedrants and supplies a generalization of an earlier result on vertex-transitive graphs. The argument structure relies on enumeration of connection sets in dihedral groups of order 2n together with reduction to the known arc-transitive case; no machine-checked proofs, reproducible code, or parameter-free derivations are indicated.

major comments (1)
  1. The central classification of non-arc-transitive dihedrants is stated only at the level of existence; no explicit list of the families (or the corresponding connection sets) appears in the abstract or the supplied description, so the reduction steps to the Marušič-Pisanski and Feng et al. results cannot be checked for completeness or correctness.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful summary and for recognizing the significance of the work in completing the classification of trivalent bi-dihedrants. We address the single major comment below.

read point-by-point responses

  1. Referee: The central classification of non-arc-transitive dihedrants is stated only at the level of existence; no explicit list of the families (or the corresponding connection sets) appears in the abstract or the supplied description, so the reduction steps to the Marušič-Pisanski and Feng et al. results cannot be checked for completeness or correctness.

    Authors: The abstract summarizes the result at a high level, as is standard. The manuscript itself contains the explicit classification: Theorem 1.1 states the complete list of families of trivalent non-arc-transitive dihedrants together with the admissible connection sets in the dihedral group, obtained by exhaustive case analysis on the possible orders and conjugacy classes of the generators. The proofs in Sections 3–4 then reduce each case to the arc-transitive classification of Marušič–Pisanski or the order-restricted results of Feng et al., with the reductions verified by direct comparison of the connection sets. The supplied arXiv manuscript therefore contains the required lists and reduction details. revision: no

Circularity Check

0 steps flagged

No significant circularity; classification is self-contained via group enumeration

full rationale

The paper derives its classification of trivalent non-arc-transitive dihedrants from structural properties of dihedral groups of order 2n together with reductions to the external arc-transitive classification of Marušič-Pisanski (2000) and order-restricted results of Feng et al. The subsequent bi-dihedrant classification is obtained directly from the new dihedrant result. No step is shown to reduce by definition, by fitted-parameter renaming, or by a load-bearing self-citation chain whose cited result itself lacks independent verification. The derivation is therefore self-contained against the cited external benchmarks and the paper's own group-theoretic case analysis.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract only; no explicit free parameters, axioms, or invented entities can be extracted. The classification necessarily relies on the standard theory of dihedral groups and Cayley graphs, but these are not itemized here.

pith-pipeline@v0.9.0 · 5718 in / 1047 out tokens · 20596 ms · 2026-05-25T18:43:21.555035+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    Alaeiyan, M

    M. Alaeiyan, M. Ghasemi, G. R. Safakish, The normality of cubic Cay ley graphs for dihedral groups, Vietnam Journal of Mathematics 37 (2009) 43–4 8

    work page 2009

  2. [2]

    Biggs, Algebraic Graph Theory, Second ed, Cambridge Univers ity Press, Cam- bridge, 1993

    N. Biggs, Algebraic Graph Theory, Second ed, Cambridge Univers ity Press, Cam- bridge, 1993

    work page 1993

  3. [3]

    Bondy, U.S.R

    J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, New Yor k: Elsevier North Holland, 1976

    work page 1976

  4. [4]

    Bosma, J

    W. Bosma, J. Cannon, C. Playoust, The MAGMA algebra system I: the user language, J. Symb. Comput. 24 (1997) 235–265

    work page 1997

  5. [5]

    Cameron, J

    P. Cameron, J. Sheehan, P. Spiga, Semiregular automorphisms o f vertex-transitive cubic graphs, European J. Combin. 27 (2006) 924–930

    work page 2006

  6. [6]

    S. Du, A. Malniˇ c, D. Maruˇ siˇ c, Classification of 2-arc-transitive dihedrants, J. Combin. Theory B 98 (2008) 1349–1372

    work page 2008

  7. [7]

    Dobson, A

    E. Dobson, A. Malniˇ c, D. Maruˇ siˇ c, L.A. Nowitz, Semiregular a utomorphisms of vertex-transitive graphs of certain valencies, J. Combin. Theory B 97 (2007) 371– 380

    work page 2007

  8. [8]

    Frucht, J.E

    R. Frucht, J.E. Graver, M.E. Watkins, The groups of the genera lized Petersen graphs, Proc. Camb. Phil. Soc. 70 (1971) 211–218

    work page 1971

  9. [9]

    Godsil, On the full automorphism group of a graph, Combinato rica 1 (1981) 243–256

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

    work page 1981

  10. [10]

    Godsil, The automorphism group of some cubic Cayley graphs , European J

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

    work page 1983

  11. [11]

    Kov´ acs, B

    I. Kov´ acs, B. Kuzman, A. Malniˇ c, S. Wilson, Characterizatio n of edge-transitive 4-valent bicirculants, J. Graph Theory 69 (2012) 441–463. 28

    work page 2012

  12. [12]

    Maruˇ siˇ c, On 2-arc-transitivity of Cayley graphs, J

    D. Maruˇ siˇ c, On 2-arc-transitivity of Cayley graphs, J. Combin. Theory B 87 (2003) 162–196

    work page 2003

  13. [13]

    Maruˇ siˇ c, T

    D. Maruˇ siˇ c, T. Pisanski, Symmetries of hexagonal molecular graphs on the torus, Croat. Chem. Acta 73 (2000) 969–981

    work page 2000

  14. [14]

    Nedela, M

    R. Nedela, M. ˇSkoviera, Which generalized Petersen graphs are Cayley graphs?, J. Graph Theory 19 (1995) 1–11

    work page 1995

  15. [15]

    Pisanski, A classification of cubic bicirculants, Discrete Math

    T. Pisanski, A classification of cubic bicirculants, Discrete Math. 307 (2007) 567–578

    work page 2007

  16. [16]

    Potoˇ cnik, P

    P. Potoˇ cnik, P. Spiga, G. Verret, Cubic vertex-transitive graphs on up to 1280 vertices, J. Symb. Comput. 50 (2013) 465–477

    work page 2013

  17. [17]

    Watkins, A theorem on Tait colorings with an application to the generalized Petersen graphs, J

    M.E. Watkins, A theorem on Tait colorings with an application to the generalized Petersen graphs, J. Combin. Theory 6 (1969) 152–164

    work page 1969

  18. [18]

    Wielandt, Finite Permutation Groups, Academic Press, New Yo rk, 1964

    H. Wielandt, Finite Permutation Groups, Academic Press, New Yo rk, 1964

    work page 1964

  19. [19]

    Xu, Automorphism groups and isomorphisms of Cayley digrap hs, Discrete Math

    M.Y. Xu, Automorphism groups and isomorphisms of Cayley digrap hs, Discrete Math. 182 (1998) 309–319

    work page 1998

  20. [20]

    Zhang, J.-X

    M.-M. Zhang, J.-X. Zhou, Trivalent vertex-transitive bi-dihedr ants, Discrete Math. 340 (2017) 1757–1772

    work page 2017

  21. [21]

    Zhang, Y.-Q

    W.-J. Zhang, Y.-Q. Feng, J.-X. Zhou, Cubic vertex-transitive n on-Cayley graphs of order 12 p, SCIENCE CHINA Mathematics 61 (2018) 1153–1162

    work page 2018

  22. [22]

    Zhou, Y.-Q

    C. Zhou, Y.-Q. Feng, Automorphism groups of connected cubic Cayley graphs of order 4 p, Algebra Colloq. 14 (2007) 351–359

    work page 2007

  23. [23]

    Zhou, Y.-Q

    J.-X. Zhou, Y.-Q. Feng, Cubic vertex-transitive non-Cayley gr aphs of order 8 p, The Electronic Journal of Combinatorics 19 (2012) #P53

    work page 2012

  24. [24]

    Zhou, Y.-Q

    J.-X. Zhou, Y.-Q. Feng, Cubic bi-Cayley graphs over abelian grou ps, European J. Combin. 36 (2014) 679–693

    work page 2014

  25. [25]

    J.-X. Zhou, M. Ghasemi, Automorhisms of a family of cubic graphs , Algebra Collo- quium 20 (2013) 495–506

    work page 2013

  26. [26]

    Zhou, Y.-Q

    J.-X. Zhou, Y.-Q. Feng, The automorphisms of bi-Cayley graphs , J. Combin. Theory B 116 (2016) 504–532. 29

    work page 2016