Independent sets with domination constraints (Q1962033)

If \(\rho\) is a set of positive integers, then the \(\rho\)-IS problem is the problem to decide for a given graph \(G\), whether \(G\) has an independent set of vertices \(S\neq\varnothing\) with \(|S|\geq\min\{k\mid k\not\in\rho\}\) such that \(|N(v)\cap S|\in\rho\) for each \(v\in S\); here \(N(v)\) denotes the set of vertices adjacent to \(v\) in \(G\). Various cases of the \(\rho\)-IS problem are investigated from the viewpoint of algorithmic complexity.