Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results

Madhura Dutta, Anil Maheshwari, Subhas C. Nandy +1

{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least…