On the independent dominating set polytope

In this paper, we consider the independent dominating set polytope. We give a complete linear description of that polytope when the graph is reduced to a cycle. This description uses a general class of valid inequalities introduced in [T.M. Contenza, Some results on the dominating set polytope, Ph.D. Dissertation, University of Kentucky, 2000]. We devise a polynomial time separation algorithm for these inequalities. As a consequence, we obtain a polynomial time cutting plane algorithm for the minimum (maximum) independent dominating set problem on a cycle. We also introduce a lifting operation called twin operation, and discuss some polyhedral consequences. In particular, we show that the above results can be extended to a more general class of graphs.

[1]  Mihalis Yannakakis,et al.  Edge Dominating Sets in Graphs , 1980 .

[2]  Dieter Kratsch,et al.  Domination on Cocomparability Graphs , 1993, SIAM J. Discret. Math..

[3]  Michel Balinski,et al.  Of Stable Marriages and Graphs, and Strategy and Polytopes , 1997, SIAM Rev..

[4]  C. P. Rangan,et al.  A Unified Approach to Domination Problems on Interval Graphs , 1988, Inf. Process. Lett..

[5]  Gerard J. Chang,et al.  Algorithmic Aspects of Domination in Graphs , 1998 .

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

[7]  Dieter Kratsch,et al.  On Domination Problems for Permutation and Other Graphs , 1987, Theor. Comput. Sci..

[8]  Ali Ridha Mahjoub,et al.  Polytope Des Absorbants Dans Une Classe De Graphe a Seuil , 1983 .

[9]  Martin Farber,et al.  Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..

[10]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[11]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[12]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[13]  Vadim V. Lozin,et al.  Independent domination in finitely defined classes of graphs , 2003, Theor. Comput. Sci..

[14]  Lonnie Athens.  ‘Domination’ , 2002 .

[15]  Lutz Volkmann,et al.  Unique irredundance, domination and independent domination in graphs , 2005, Discret. Math..

[16]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[17]  Martin Farber,et al.  Domination in Permutation Graphs , 1985, J. Algorithms.

[18]  Martin Farber,et al.  Independent domination in chordal graphs , 1982, Oper. Res. Lett..

[19]  Yehoshua Perl,et al.  Clustering and domination in perfect graphs , 1984, Discret. Appl. Math..

[20]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[22]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[23]  Ali Ridha Mahjoub,et al.  On the dominating set polytope , 2008, Eur. J. Comb..

[24]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[25]  Ali Ridha Mahjoub,et al.  One-node cutsets and the dominating set polytope , 1997, Discret. Math..