AN ALGORITHM FOR A MINIMUM 3−TUPLE DOMINATING SET(3−TPDS) IN AN INTERVAL GRAPH

In a graph H, a vertex that dominates itself and all its neighbors is called a dominating vertex. Given a positive integer k, the k−Tuple domination problem involves finding the smallest vertex subset that contains at least k vertices which dominate all vertices in the graph. The scenario when k=3 is called a 3− Tuple domination problem. In this article, we studied the 3−Tuple domination set (3−TPDS) using an algorithm to solve the interval family graphs, which takes O(n2) times, where n denotes how many vertices are there in the given interval family graph.