Let G=(V,E) be an undirected graph. We call D_t ⊆ V as a total
dominatin...
In this article, we study a generalized version of the maximum independe...
In this article, we study a variant of the minimum dominating set proble...
In this article, we study generalized liar's dominating set problem in
g...
share