A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs

A set D ⊆ V is a restrained dominating set of a graph G = (V, E) if every vertex in V\D is adjacent to a vertex in D and a vertex in V\D. Given a graph G and a positive integer k, the restrained domination problem is to check whether G has a restrained dominating set of size at most k. The restrained domination problem is known to be NP-complete even for chordal graphs. In this paper, we propose a linear time algorithm to compute a minimum restrained dominating set of a proper interval graph. We present a polynomial time reduction that proves the NP-completeness of the restrained domination problem for undirected path graphs, chordal bipartite graphs, circle graphs, and planar graphs.

[1]  J. Mark Keil.  The Complexity of Domination Problems in Circle Graphs , 1993, Discret. Appl. Math..

[2]  Johannes H. Hattingh,et al.  Restrained domination in graphs , 1999, Discret. Math..

[3]  J. Mark Keil,et al.  Computing a minimum outer-connected dominating set for the class of chordal graphs , 2013, Inf. Process. Lett..

[4]  Johannes H. Hattingh,et al.  Restrained Domination Excellent Trees , 2008, Ars Comb..

[5]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[6]  Jan Arne Telle,et al.  Algorithms for Vertex Partitioning Problems on Partial k-Trees , 1997, SIAM J. Discret. Math..

[7]  Ernst J. Joubert.  Total restrained domination in claw-free graphs with minimum degree at least two , 2011, Discret. Appl. Math..

[8]  Johannes H. Hattingh,et al.  Restrained domination in unicyclic graphs , 2009, Discuss. Math. Graph Theory.

[9]  Andreas Brandstädt,et al.  The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs , 1987, Theor. Comput. Sci..

[10]  Johannes H. Hattingh,et al.  An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree , 2009, Discret. Appl. Math..

[11]  Lei Chen,et al.  NP-completeness and APX-completeness of restrained domination in graphs , 2012, Theor. Comput. Sci..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Johannes H. Hattingh,et al.  Restrained domination in trees , 2000, Discret. Math..

[14]  Johannes H. Hattingh,et al.  Restrained Domination in Claw-Free Graphs with Minimum Degree at Least Two , 2009, Graphs Comb..

[15]  Michael A. Henning.  Graphs with large restrained domination number , 1999 .

[16]  Bhawani Sankar Panda,et al.  A linear time recognition algorithm for proper interval graphs , 2003, Inf. Process. Lett..

[17]  Kellogg S. Booth,et al.  Dominating Sets in Chordal Graphs , 1982, SIAM J. Comput..

[18]  Johannes H. Hattingh,et al.  Trees with Equal Domination and Restrained Domination Numbers , 2006, J. Glob. Optim..

[19]  Johannes H. Hattingh,et al.  Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs , 2008, Discret. Math..