In this paper, one of the most famous NP-complete problems in graph theory, the total dominating set problem, was investigated and a new quadratic integer programming model was presented. Finally, an SDP relaxation models are proposed. Finding the efficiency of the relaxation could be a future research direction.
