Published Paper Details:

Among the various applications of the theory of perfect domination , the most often discussed is communication network. There has been persistent in the algorithmic aspects of interval graphs in past decades spurred much by their numerous applications of interval graphs corresponding to interval families. The research of the domination in graphs has been an evergreen of the graph theory. Its basic concept is the dominating set and the domination number. The theory of domination in graphs was introduced by O. Ore and C. Berge . A survey on results and applications of dominating sets was presented by E.J. Cockayane and S.T. Hedetniemi . The concept of split and non split domination in graphs and also in Maheswari, B et all . The concept of restrained domination was introduced by J.A. Telle and A. Proskurowski , albeit indirectly, as a vertex partitioning problem. One application of domination is that of prisoners and guards. In this paper, we introduce an algorithm to find a split odd vertices perfect dominating set of an interval graph.