Published online by Cambridge University Press: 25 November 2019
For a finite group $G$, let $\unicode[STIX]{x1D6E5}(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In this paper, we obtain a necessary and sufficient condition which guarantees that the complement of the character graph $\unicode[STIX]{x1D6E5}(G)$ of a finite group $G$ is a nonbipartite Hamiltonian graph.
This research was supported in part by a grant from the School of Mathematics, Institute for Research in Fundamental Sciences (IPM).