Symmetric graphs of valency seven and their basic normal quotient graphs

DOI10.1515/MATH-2021-0062MaRDI QIDQ2669013zbMATH OpenOpenAlexFDO

Authors Jiangmin Pan, Chao Wang, Junjie Huang

Publication date 9 March 2022

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1906.09755

zbMATH Keywords

normal quotient graphsimple groupsymmetric graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Abstract: A graph $Gamma$ is basic if Aut$Gamma$ has no normal subgroup $Ne1$ such that $Gamma$ is a normal cover of the normal quotient graph $Gamm{a}_N$. In this paper, we completely determine the basic normal quotient graphs of all connected 7-valent symmetric graphs of order $2p{q}^n$ with $p<q$ odd primes, which consist of an infinite family of dihedrants of order $2p$ with $pequiv1$(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 $2p{q}^n$ with $7ep<q$ primes, partially generalizing Theorem 1 of Conder, Li and Potocnik [On the orders of arc-transitive graphs, J. Algebra 421 (2015), 167-186].

Recommendations

• Valency seven symmetric graphs of order 2pq.
• Symmetric graphs of order four times a prime power and valency seven
• Symmetric graphs of valency five and their basic normal quotients
• On symmetric graphs of order four times an odd square-free integer and valency seven
• On prime-valent symmetric graphs of order four times an odd prime power

Cites work

• A classification of symmetric graphs of order 3p
• A family of edge-transitive Cayley graphs
• An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
• Analysing finite locally 𝑠-arc transitive graphs
• Arc-transitive graphs of square-free order and small valency
• Arc-transitive prime-valent graphs of order twice a prime power.
• Finite 2-arc-transitive abelian Cayley graphs
• Finite locally-quasiprimitive graphs
• scientific article; zbMATH DE number 5504628 (Why is no real title available?)
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• On semisymmetric cubic graphs of order \(6p^{2}\)
• On the Classification of Symmetric Graphs with a Prime Number of Vertices
• On the orders of arc-transitive graphs
• On weakly symmetric graphs of order twice a prime
• One-regular graphs of square-free order of prime valency
• Pentavalent symmetric graphs of order twice a prime power
• Symmetric graphs of order four times a prime power and valency seven
• Symmetric graphs of valency five and their basic normal quotients
• TETRAVALENT s-TRANSITIVE GRAPHS OF ORDER TWICE A PRIME POWER
• Tetravalent half-arc-transitive graphs of order \(2pq\)
• The Magma algebra system. I: The user language
• Valency seven symmetric graphs of order 2pq.
• Vertex-primitive s-arc-transitive digraphs of alternating and symmetric groups

Cited in

(6)

• A characterization of a class of symmetric graphs of twice prime valency
• Valency seven symmetric graphs of order 2pq.
• scientific article; zbMATH DE number 6844522 (Why is no real title available?)
• Symmetric graphs of order four times a prime power and valency seven
• On prime-valent symmetric graphs of order four times an odd prime power
• scientific article; zbMATH DE number 5244599 (Why is no real title available?)

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Symmetric graphs of valency seven and their basic normal quotient graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669013)