Pentavalent symmetric graphs of order four times an odd square-free integer

DOI10.26493/1855-3974.1333.68FMaRDI QIDQ5225025zbMATH OpenOpenAlexWikidataFDO

Authors Bo Ling, Cixuan Wu, Ben Gong Lou

Publication date 25 July 2019

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

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

zbMATH Keywords

automorphism grouparc-transitive graphnormal quotient

Mathematics Subject Classification ID

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

Abstract: A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, #P233, 2011) and Pan et al. (Electronic J. Combin. 20, #P36, 2013) determined all pentavalent symmetric graphs of order $4pq$. In this paper, we shall generalize this result by determining all connected pentavalent symmetric graphs of order four times an odd square-free integer. It is shown in this paper that, for each of such graphs $itGamma$, either the full automorphism group $sfAutitGamma$ is isomorphic to $sfPSL(2,p)$, $sfPGL(2,p)$, $sfPSL(2,p)imesmathbb{Z}_2$ or $sfPGL(2,p)imesmathbb{Z}_2$, or $itGamma$ is isomorphic to one of 8 graphs.

Recommendations

• Pentavalent symmetric graphs of order \(2pq\)
• Pentavalent symmetric graphs of order \(4p\)
• Pentavalent symmetric graphs of order \(2pqr\)
• Pentavalent symmetric graphs of order \(8p^2\)
• Classifying pentavalent symmetric graphs of order \(40p\).

Cites work

• scientific article; zbMATH DE number 3135133 (Why is no real title available?)
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 3939563 (Why is no real title available?)
• scientific article; zbMATH DE number 4004443 (Why is no real title available?)
• scientific article; zbMATH DE number 3758571 (Why is no real title available?)
• A note on pentavalent \(s\)-transitive graphs
• An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
• Arc-transitive graphs of square-free order and small valency
• Arc-transitive pentavalent graphs of order 4\(pq\)
• Finite 2-arc-transitive abelian Cayley graphs
• On prime-valent symmetric graphs of square-free order
• On symmetric graphs of valency five
• Pentavalent one-regular graphs of square-free order
• Pentavalent symmetric graphs of order 12\(p\)
• Pentavalent symmetric graphs of order \(2pq\)
• Pentavalent symmetric graphs of order \(2pqr\)
• Pentavalent symmetric graphs of order twice a prime power
• The Magma algebra system. I: The user language
• There exist no arc-regular prime-valent graphs of order four times an odd square-free integer
• \(3\)-designs from PGL\((2,q)\)

Cited in

(3)

• Pentavalent semisymmetric graphs of square‐free order
• Generalised voltage graphs
• On symmetric graphs of order four times an odd square-free integer and valency seven

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Pentavalent symmetric graphs of order four times an odd square-free integer

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