Perfect k-domination in graphs

Let k be a positive integer. A vertex subset D of a graph G = (V, E) is a perfect k-dominating set of G if every vertex v of G, not in D, is adjacent to exactly k vertices of D. The minimum cardinality of a perfect k-dominating set of G is the perfect k-domination number I³kp(G). In this paper, we generalize perfect domination to perfect k-domination, where many bounds ofI³kp(G) are obtained. We prove that the perfect k-domination problem is NP-complete for general graphs.

[1]  Michael R. Fellows,et al.  Perfect domination , 1991, Australas. J Comb..

[2]  Jan Kratochvíl,et al.  On the Computational Complexity of Codes in Graphs , 1988, MFCS.

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

[4]  Frédéric Maffray,et al.  Exact double domination in graphs , 2005, Discuss. Math. Graph Theory.

[5]  M. Jacobson,et al.  n-Domination in graphs , 1985 .

[6]  P. Cull,et al.  Perfect codes on graphs , 1997, Proceedings of IEEE International Symposium on Information Theory.

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

[8]  Quentin F. Stout,et al.  PERFECT DOMINATING SETS , 1990 .

[9]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[10]  Frank Harary,et al.  Graph Theory , 2016 .