On the full automorphism group of a Hamiltonian cycle system of odd order

DOI10.1007/S00373-015-1584-8zbMATH Open1327.05194OpenAlexW1837952753MaRDI QIDQ897244FDOQ897244

Authors Marco Buratti, Graham J. Lovegrove, Tommaso Traetta

Publication date 17 December 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

automorphism groupHamiltonian cycle system

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: It is shown that a necessary condition for an abstract group G to be the full automorphism group of a Hamiltonian cycle system is that G has odd order or it is either binary, or the affine linear group AGL(1; p) with p prime. We show that this condition is also sufficient except possibly for the class of non-solvable binary groups.

Recommendations

• Odd-cycle systems with prescribed automorphism groups
• Even‐cycle systems with prescribed automorphism groups
• Automorphism groups with cyclic commutator subgroup and Hamilton cycles
• Odd-order Cayley graphs with commutator subgroup of order pq are hamiltonian
• Cyclic Hamiltonian cycle systems of the complete graph.

Cites work

• scientific article; zbMATH DE number 3645098 (Why is no real title available?)
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• Cyclic Hamiltonian cycle systems of the complete graph.
• Dihedral Hamiltonian cycle systems of the cocktail party graph
• Doubly transitive 2-factorizations
• Even‐cycle systems with prescribed automorphism groups
• Every finite solvable group with a unique element of order two, except the quaternion group, has a symmetric sequencing
• Every group is the collineation group of some projective plane
• Hamiltonian cycle systems which are both cyclic and symmetric
• Odd-cycle systems with prescribed automorphism groups
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
• On 2-pyramidal Hamiltonian cycle systems
• On the groups of automorphisms of Steiner triple and quadruple systems
• Round-dance neighbour designs from terraces
• Some results on 1-rotational Hamiltonian cycle systems
• Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
• Symmetric Hamilton cycle decompositions of the complete graph

Cited in

(4)

• Odd-cycle systems with prescribed automorphism groups
• Even‐cycle systems with prescribed automorphism groups
• On the existence of unparalleled even cycle systems
• On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs

This page was built for publication: On the full automorphism group of a Hamiltonian cycle system of odd order

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