Abstract
It is shown in this paper that the weighted domination problem and its three variants, the weighted connected domination, total domination, and dominating clique problems are NP-complete on cobipartite graphs when arbitrary integer vertex weights are allowed and all of them can be solved in polynomial time on cocomparability graphs if vertex weights are integers and less than or equal to a constant c. The results are interesting because cocomparability graphs properly contain cobipartite graphs and the cardinality cases of the above problems are trivial on cobipartite graphs. On the other hand, an O(¦V¦ 2) algorithm is given for the weighted independent perfect domination problem of a cocomparability graph G = ( V. E).
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
