In the Roman domination problem, an undirected simple graph G(V,E) is
gi...
In this article, we consider the c-dispersion problem in a metric space
...
In this article, we consider the Euclidean dispersion problems. Let
P={p...
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...