Pentavalent symmetric graphs of order twice a prime power
Yan-Quan Feng, Jin-Xin Zhou, Yan-Tao Li

TL;DR
This paper classifies connected pentavalent symmetric graphs of order twice a prime power, identifying basic graphs and their automorphism groups, and explores their structure as covers of a dipole graph.
Contribution
It provides a complete classification of basic connected pentavalent symmetric graphs of order 2p^n and determines their automorphism groups and covering structures.
Findings
Basic graphs are either of order 6, 16, 250, or belong to three infinite Cayley graph families.
Automorphism groups of these graphs are explicitly computed.
Connected pentavalent symmetric graphs of order 2p^2 are classified.
Abstract
A connected symmetric graph of prime valency is {\em basic} if its automorphism group contains no nontrivial normal subgroup having more than two orbits. Let be a prime and a positive integer. In this paper, we investigate properties of connected pentavalent symmetric graphs of order , and it is shown that a connected pentavalent symmetric graph of order is basic if and only if it is either a graph of order , , , or a graph of three infinite families of Cayley graphs on generalized dihedral groups -- one family has order with or , one family has order with , and the other family has order . Furthermore, the automorphism groups of these basic graphs are computed. Similar works on cubic and tetravalent symmetric graphs of order have been done. It is shown that basic graphs of connected…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
