2000 character limit reached
On minimal graphs for hamiltonian groups and their fixing set
Published 29 Jan 2026 in math.CO | (2601.21575v1)
Abstract: A finite non-abelian group $H$ is hamiltonian if all of its subgroups are normal. We compute the minimal orders of graphs having a hamiltonian group as their automorphism group. The fixing number of a graph $Γ$ is the minimum cardinality of a subset $S$ of $V(Γ)$ such that the stabilizer of $S$ is trivial. For a given finite group $G$, the fixing set is defined as the set comprising all possible fixing numbers of graphs having group $G$ as their automorphism groups. We determine the fixing sets corresponding to finite hamiltonian groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.