ROMAN DOUBLY CONNECTED DOMINATION NUMBER USING AN ALGORITHM OF AN INTERVAL GRAPH

A survey on results and applications of dominating sets was presented by 
E.J. Cockayane and S.T. Hedetniemi[1]. Among the various applications of the theory of 
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. 
Today graph theory is one of the most flourishing branches of modern mathematics. 
Graphs are useful in enhancing the understanding of the organization and behavioral 
characteristics of complex system. The study of domination in graphs originated around 1850 
has become the source of interest to the researchers.