On minimal graphs for hamiltonian groups and their fixing set
Combinatorics
2026-01-30 v1
Abstract
A finite non-abelian group 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 of such that the stabilizer of is trivial. For a given finite group , the fixing set is defined as the set comprising all possible fixing numbers of graphs having group as their automorphism groups. We determine the fixing sets corresponding to finite hamiltonian groups.
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