Hamiltonicity of \(3_t\)EC graphs with \(\alpha=\kappa +1\) (Q2036021): Difference between revisions

Summary: A set \(S\) of vertices in a graph \(G\) is a total dominating set of \(G\) if every vertex of \(G\) is adjacent to some vertex in \(S\). The minimum cardinality of a total dominating set of \(G\) is the total domination number \(\gamma_t( G)\) of \(G\). The graph \(G\) is total domination edge-critical, or \(\gamma_t\text{EC} \), if for every edge \(e\) in the complement of \(G, \gamma_t( G + e)< \gamma_t( G)\). If \(G\) is \(\gamma_t\text{EC}\) and \(\gamma_t( G)=k\), we say that \(G\) is \(k_t\text{EC} \). In this paper, we show that every \(3_t\text{EC}\) graph with \(\delta( G)\geq2\) and \(\alpha( G)=\kappa( G)+1\) has a Hamilton cycle.