A unified approach to domination problems on interval graphs

Let G=(v, E)be a graph and let A and B be sets of vertices. A dominates B if every vertex in B -A is adjacent to at least one vertex in A; A totally dominates B if every vertex in B is adjacent to at least one vertex in A. A is called a dominating set of the graph if A dominates V and is called a totally dominating set if it totally dominates I’.