English

On minimal graphs for hamiltonian groups and their fixing set

Combinatorics 2026-01-30 v1

Abstract

A finite non-abelian group HH 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 Γ\Gamma is the minimum cardinality of a subset SS of V(Γ)V(\Gamma) such that the stabilizer of SS is trivial. For a given finite group GG, the fixing set is defined as the set comprising all possible fixing numbers of graphs having group GG as their automorphism groups. We determine the fixing sets corresponding to finite hamiltonian groups.

Keywords

Cite

@article{arxiv.2601.21575,
  title  = {On minimal graphs for hamiltonian groups and their fixing set},
  author = {Kirti Sahu and Ranjit Mehatari},
  journal= {arXiv preprint arXiv:2601.21575},
  year   = {2026}
}

Comments

10 Pages, 2 figures

R2 v1 2026-07-01T09:25:31.473Z