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

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

Authors: Marco Buratti, Graham J. Lovegrove, Tommaso Traetta 

Publication date: 17 December 2015

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

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.

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

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.

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)

Cites Work

• Title not available (Why is that?)
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
• On 2-pyramidal Hamiltonian cycle systems
• Some Results on 1‐Rotational Hamiltonian Cycle Systems
• On the groups of automorphisms of Steiner triple and quadruple systems
• Odd-cycle systems with prescribed automorphism groups
• Even‐cycle systems with prescribed automorphism groups
• Dihedral Hamiltonian cycle systems of the cocktail party graph
• Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric
• Every group is the collineation group of some projective plane
• Every finite solvable group with a unique element of order two, except the quaternion group, has a symmetric sequencing
• Round-dance neighbour designs from terraces
• Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
• Doubly transitive 2-factorizations
• Symmetric Hamilton cycle decompositions of the complete graph

Cited In (4)

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

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)