Domination Number and Hamiltonicity of Graphs

Let \( G \) be a \( k \)-connected (\( k \geq 2 \)) graph of order \( n \). If \( \gamma(G^c) \geq n – k \), then \( G \) is Hamiltonian or \( K_k \vee K_{k+1}^c \), where \( \gamma(G^c) \) is the domination number of the complement of the graph \( G \).