$(1,j)$-set problem in graphs

Arijit Bishnu, Kunal Dutta, Arijit Ghosh +1

A subset $D\subseteq V$of a graph $G=(V,E)$ is a $(1,j)$-set if every vertex $v\in V\setminus D$ is adjacent to at least $1$ but not more than $j$ vertices in D. The cardin…