For each v ariable u iconstruct a cycle on four vertices C 4where two non.
There was a problem providing the content you requested
We consider the graph theoretical represen tation of this problem as a. Distance independent domination in graphs. Furthermore, in T each edge between a vertex. We ma y assume that T is rooted. Suppose, on the other hand, that each of the sets W 2 ,