pith. sign in

arxiv: 1906.09755 · v1 · pith:M3ISXRA4new · submitted 2019-06-24 · 🧮 math.CO

Symmetric graphs of valency seven and their basic normal quotient graphs

Jiangmin Pan , Junjie Huang , Chao Wang This is my paper

Pith reviewed 2026-05-25 17:41 UTC · model grok-4.3

classification 🧮 math.CO
keywords symmetric graphs7-valent graphsnormal quotientsdihedrantsarc-transitive graphsgraph orders 2pq^n
0
0 comments X

The pith

Connected 7-valent symmetric graphs of order 2pq^n have basic normal quotients that are dihedrants of order 2p or one of six small graphs.

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

This paper determines the basic normal quotient graphs for every connected 7-valent symmetric graph of order 2pq^n where p and q are distinct odd primes with p smaller than q. These quotients consist of an infinite family of dihedrants of order 2p whenever p is congruent to 1 modulo 7, together with exactly six exceptional graphs whose orders do not exceed 310. A reader would care because the result produces an explicit reduction of the original graphs to these base cases and immediately implies that only finitely many 2-arc-transitive examples exist for each fixed exponent n.

Core claim

The basic normal quotient graphs of all connected 7-valent symmetric graphs of order 2pq^n with p < q odd primes consist of an infinite family of dihedrants of order 2p with p≡1(mod 7), and 6 specific graphs with order at most 310.

What carries the argument

Normal quotient analysis that factors out a nontrivial normal subgroup N of the automorphism group to produce the basic quotient graph Γ_N.

If this is right

  • For any fixed positive integer n there are only finitely many connected 2-arc-transitive 7-valent graphs of order 2pq^n with 7 ≠ p < q primes.
  • Classification of all such graphs reduces to checking the infinite dihedrant family and the six small graphs.
  • All other graphs in the family are normal covers of these basic quotients.

Where Pith is reading between the lines

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

  • The same normal-quotient reduction may apply to symmetric graphs of valency 7 with other prime-power orders.
  • Explicit constructions from the dihedrant family can be tested for additional symmetry properties such as higher arc-transitivity.
  • For small n the six exceptional graphs can be enumerated computationally to list all examples.

Load-bearing premise

Every connected 7-valent symmetric graph of the given order admits a normal subgroup of its automorphism group whose quotient is one of the listed basic graphs.

What would settle it

A connected 7-valent symmetric graph of order 2pq^n whose basic normal quotient is neither a dihedrant of order 2p with p≡1 mod 7 nor one of the six listed graphs would disprove the classification.

read the original abstract

A graph $\Gamma$ is basic if Aut$\Gamma$ has no normal subgroup $N\ne1$ such that $\Gamma$ is a normal cover of the normal quotient graph $\Gamma_N$. In this paper, we completely determine the basic normal quotient graphs of all connected 7-valent symmetric graphs of order $2pq^n$ with $p < q$ odd primes, which consist of an infinite family of dihedrants of order $2p$ with $p\equiv1$(mod 7), and 6 specific graphs with order at most 310. As a consequence, it shows that, for any given positive integer n, there are only finitely many connected 2-arc-transitive 7-valent graphs of order $2pq^n$ with $7\ne p<q$ primes, partially generalizing Theorem 1 of Conder, Li and Potocnik [On the orders of arc-transitive graphs, J. Algebra 421 (2015), 167-186].

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

0 major / 2 minor

Summary. The paper claims a complete determination of the basic normal quotient graphs of all connected 7-valent symmetric graphs of order 2pq^n (p < q odd primes). These quotients consist of an infinite family of dihedrants of order 2p with p ≡ 1 (mod 7) together with six explicit graphs of order at most 310. As a corollary the authors obtain that, for each fixed n, only finitely many connected 2-arc-transitive 7-valent graphs of the given order exist, partially generalizing the Conder–Li–Potocnik theorem on orders of arc-transitive graphs.

Significance. If the classification holds, the result supplies an explicit list of all possible basic quotients in this order class, thereby reducing the problem of enumerating all such symmetric graphs to the construction of normal covers of a short, explicitly described list. The finiteness statement for the 2-arc-transitive subfamily is a concrete, falsifiable consequence that extends existing finiteness theorems in algebraic graph theory. The argument relies on previously established results about arc-transitive groups of degree 7 and normal-quotient reductions whose hypotheses are satisfied by the given order and valency.

minor comments (2)
  1. The abstract states that the six exceptional graphs have order at most 310, but the main text should include a short table (or explicit list) giving their orders, automorphism-group orders, and whether they are 2-arc-transitive, to make the finiteness corollary immediately verifiable.
  2. Notation for the dihedral graphs D_{2p} (or the corresponding Cayley graphs) should be fixed once at the beginning of §3 and used consistently; the current alternation between “dihedrant” and “Cayley graph on D_{2p}” is harmless but slightly distracting.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and for recommending acceptance. The referee's summary accurately captures the main results on the basic normal quotients of 7-valent symmetric graphs of order 2pq^n.

Circularity Check

0 steps flagged

No significant circularity; classification via independent prior theorems and case analysis

full rationale

The paper's central result is a classification of basic normal quotient graphs for connected 7-valent symmetric graphs of order 2pq^n (p<q odd primes) obtained by reducing via normal quotients to an explicit list: an infinite family of dihedrants of order 2p with p≡1(mod 7) plus six small graphs. This proceeds by standard case analysis on the order's prime factorization and the structure of arc-transitive automorphism groups, invoking only previously established external theorems (generalizing Conder-Li-Potocnik Theorem 1, whose authors are distinct). No self-definitional relations, no parameters fitted to data then relabeled as predictions, and no load-bearing self-citations appear. The quotients are not defined in terms of the graphs they classify; the argument is self-contained against external benchmarks on symmetric graphs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review yields no visible free parameters, ad-hoc axioms, or invented entities; the result rests on standard facts from finite group theory and prior classification theorems on arc-transitive graphs.

pith-pipeline@v0.9.0 · 5706 in / 1211 out tokens · 30082 ms · 2026-05-25T17:41:40.187347+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

24 extracted references · 24 canonical work pages

  1. [1]

    Bosma, J

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

    work page 1997

  2. [2]

    C. Y. Chao, On the classification of symmetric graphs with a prime n umber of vertices, Trans. Amer. Math. Soc. 158 (1971), 247–256

    work page 1971

  3. [3]

    Cheng, J

    Y. Cheng, J. Oxley, On weakly symmetric graphs of order twice a p rime, J. Combin. Theory Ser. B 42 (1987), 196–211

    work page 1987

  4. [4]

    M. D. E. Conder, C. H. Li, P. Potoˇ cnik, On the orders of arc-tr ansitive graphs, J. Algebra 421 (2015), 167–186

    work page 2015

  5. [5]

    J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, R. A. Wils on, Atlas of Finite Groups , Oxford Univ. Press, London/New York, 1985

    work page 1985

  6. [6]

    J. D. Dixon, B. Mortimer, Permutation groups, Springer-Verlag, Ne w York, 1997

    work page 1997

  7. [7]

    Y. Q. Feng, Y. T. Li, One-regular graphs of square-free order of prime valency, Europ. J. Combin. 32 (2011), 261–275

    work page 2011

  8. [8]

    Y. Q. Feng, J. X. Zhou, Y. T. Li, Pentavalent symmetric graphs o f order twice a prime power. Discrete Math. 339 (2016), 2640–2651

    work page 2016

  9. [9]

    Giudici, C

    M. Giudici, C. H. Li, C. E. Praeger, Analysing finite locally s-arc-transitive graphs, Trans. Amer. Math. Soc. 356 (2003), 291–317

    work page 2003

  10. [10]

    S. T. Guo, Y. Li, X. H. Hua, ( G, s)-transitive graphs of valency 7. Algebra Coll. 23(3) (2016), 493–500

    work page 2016

  11. [11]

    S. T. Guo, J. X. Zhou, Y. Q. Feng, Pentavalent symmetric grap hs of order 12 p, Electron. J. Combin. 18 (2011), P2.33

    work page 2011

  12. [12]

    Huppert, W

    B. Huppert, W. Lempken, Simple groups of order divisible by at mo st four primes, Proc. F. Scorina Gemel State Univ. 16 (2000), 64–75

    work page 2000

  13. [13]

    X. H. Hua, L. Chen, X. Xiang, Valency seven symmetric graphs o f order 2 pq, Czechoslovak Math. J. 68(3) (2018), 581–599

    work page 2018

  14. [14]

    C. H. Li, Z. P. Lu, G. X. Wang, Arc-transitive graphs of square -free order and small valency, Discrete Math. 339 (2016), 2907–2918

    work page 2016

  15. [15]

    C. H. Li, J. M. Pan, Finite 2-arc-transitive abelian Cayley graphs , Europ. J. Combin. 29 (2008), 148–158

    work page 2008

  16. [16]

    C. H. Li, C. E. Praeger, A. Venkatesh, S. M. Zhou, Finite locally- quasiprimitive graphs, Discrete Math. 246 (2002), 197–218

    work page 2002

  17. [17]

    Jafarzadeh, A

    A. Jafarzadeh, A. Iranmanesh, On simple Kn-groups for n = 5, 6 in: C.M. Campbell, M. R. Quick, E. F. Robertson, G. C. Smith (Eds.), Groups St. Andrews 2005, in: London Math. Soc. Lecture Note Ser., vol. 2, Cambridge University Press, Cambridge, 2007, 66 8–680

    work page 2005

  18. [18]

    Z. P. Lu, C. Q. Wang, M. Y. Xu, On semisymmetric cubic graphs of order 6 p2, Sci. China Ser. A 47 (2004), 1–17

    work page 2004

  19. [19]

    J. M. Pan, C. H. Li, Arc-transitive prime-valent graphs of orde r twice a prime power, Ars Combin. 138 (2018), 171–191

    work page 2018

  20. [20]

    J. M. Pan, F. G. Yin, Symmetric graphs of order four times a prim e power and valency seven. J. Algebraic Appli. 17(5) (2018), 1850093

    work page 2018

  21. [21]

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

    work page 1992

  22. [22]

    R. J. Wang, M. Y. Xu, A classification of symmetric graphs of ord er 3 p, J. Combin. Theory Ser. B 58 (1993), 197–216

    work page 1993

  23. [23]

    D. W. Yang, Y. Q. Feng, J. H. Kwak, J. Lee, Symmetric graphs o f valency five and their basic normal quotients, Europ. J. Combin. Online. 14 PAN, HUANG, AND W ANG

    work page

  24. [24]

    J. X. Zhou, Y. Q. Feng, Tetravalent s-transitive graphs of order twice a prime power, J. Aust. Math. Soc. 88 (2010), 277–288. J. M. Pan, School of Statistics and Mathematics, Yunnan Univ ersity of Finance and Economics, Kunming, P. R. China E-mail address : jmpan@ynu.edu.cn J. J. Huang, School of Statistics and Mathematics, Yunnan Un iversity of Finance a...

    work page 2010