# Split Restrained Dominating Set of an Interval Graph using an Algorithm

**Year of Publication:**2012

A Sudhakaraiah, Gnana E Deepika and V Ramalatha. Article: Split Restrained Dominating Set of an Interval Graph using an Algorithm.

*International Journal of Applied Information Systems*4(9):4-9, December 2012. BibTeX@article{key:article, author = "A. Sudhakaraiah and E. Gnana Deepika and V. Ramalatha", title = "Article: Split Restrained Dominating Set of an Interval Graph using an Algorithm", journal = "International Journal of Applied Information Systems", year = 2012, volume = 4, number = 9, pages = "4-9", month = "December", note = "Published by Foundation of Computer Science, New York, USA" }

### Abstract

The various applications of the theory of Restrained 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 application of an interval graphs corresponding to an interval family I. A set is a Restrained dominating set of an Interval graph , if every vertex not in is adjacent to a vertex in and to a vertex in . In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths. For a graph , if the induced subgraph of itself is a connected component then the graph is called connected otherwise is disconnected. A dominating set of is called a Split dominating set, if the induced subgraph is disconnected. A Restrained dominating set RDS of a graph is a Split restrained dominating set, if the induced subgraph is disconnected. In this paper we present an Algorithm to find a Split Restrained dominating set of an interval graph .

### Reference

- O. Ore , Theory of Graph, Amer, Math. Soc. Colloq. Publ. 38, Providence (1962), P. 206.
- C. Berge, Graphs and Hyperactive graphs,North Holland, Amsterdram in graphs, Networks, Vol. 10 1980), 211-215.
- E. J. Cockayne, S. T. Hedetniemi, Towards a theory of domination in graphs, Networks, Vol. 7(1977), 247-261.
- V. R. Kulli, B. Janakiram, The Split domination number of a graph, Graph Theory, Notes of New York, Vol. XXXII, 16-19(1997).
- J. A. Telle and A. Proskurowski, Algorithms for vertex portioning problems on partial k-trees. Siam J. Discrete Math. 10 (1997) 529-550.
- Dr. A. Sudhakaraiah, E. Gnana Deepika, V. Rama Latha, T. Venkateswarulu, Non-Split Restrained Dominating Set Of An Interval Graph Using An Algorith, Internation Journal of Advancements in Research & Technology, ISSN 2278-7763, Volume 1, Issue 2, July-2012.
- M. Pal, S. Mondal, D. Bera and T. K. Pal, An optimal parallel algorithm for computing cutvertices and blocks on interval graphs, International Journal of Computer Mathematics, 75 (2000) 59-70.
- M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
- Tarasankar Pramanik, Sukumar Mondal and Madhumangal Pal, Minimum 2-tuple dominating set of an interval graph.
- Dr. A. Sudhakaraiah, E. Gnana Deepika, V. Rama Latha, To find a 2-tuple dominating set of an induced subgraph of a non-split dominating set of an interval graph using an algorithm, International Journal of Engineering Research and Technology, ISSN:2278-0181, Vol. 1 Issue 3, May- 2012.
- G. S. Domke, J. H. Hattingh, M. A. Henning, and L. R. Markus, Restrained domination in graphs with minimum degree two. J. Combin. Math. Combin. Comput. 35 (2000) 239-254.

### Keywords

Interval family, interval graph, connected graph, disconnected graph, restrained dominating set, Split restrained dominating set