Inverse [1, 2] – Domination in Graphs

Author(s): Sathish. T, Padma Priya. C Abstract: A vertex subset S of a Graph G = {V, E} is an inverse [1, 2] – dominating set if, 1≤| N(v) ∩ S′ |≤ 2, for every vertex v∈V-S’ (i. e) each vertex v∈V-S’ is adjacent to…