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

DOI10.26493/1855-3974.1333.68FzbMATH Open1416.05139arXiv1702.05750OpenAlexW2730078876WikidataQ129220797 ScholiaQ129220797MaRDI QIDQ5225025FDOQ5225025

Authors: Bo Ling, Cixuan Wu, Ben Gong Lou 

Publication date: 25 July 2019

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

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.

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

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\).

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)

Cites Work

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

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

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)