چکیده
|
In this paper, one of the most famous NP-complete problems in graph theory, the total dominating set problem, is investigated and a new quadratic integer programming model is presented. Finally, an SDP relaxation models are proposed.
|