Generalized power domination of graphs

In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for chordal graphs and for bipartite graphs. We then give a linear algorithm for the problem on trees. Finally, we propose sharp upper bounds for the power domination number of connected graphs and of connected claw-free (k+2)-regular graphs.

[1]  Min Zhao,et al.  Power domination in block graphs , 2006, Theor. Comput. Sci..

[2]  Wayne Goddard,et al.  Domination in planar graphs with small diameter , 2002 .

[3]  Stephen T. Hedetniemi,et al.  Linear Algorithms on Recursive Representations of Trees , 1979, J. Comput. Syst. Sci..

[4]  T. Baldwin,et al.  Power system observability with minimal phasor measurement placement , 1993 .

[5]  Michael A. Henning,et al.  A note on power domination in grid graphs , 2006, Discret. Appl. Math..

[6]  Ashkan Aazami,et al.  Approximation Algorithms and Hardness for Domination with Propagation , 2007, SIAM J. Discret. Math..

[7]  Rolf Niedermeier,et al.  Improved Algorithms and Complexity Results for Power Domination in Graphs , 2005, FCT.

[8]  Rolf Niedermeier,et al.  Improved Algorithms and Complexity Results for Power Domination in Graphs , 2005, Algorithmica.

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

[10]  Michael A. Henning,et al.  Domination in Graphs Applied to Electric Power Networks , 2002, SIAM J. Discret. Math..

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

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

[13]  Paul Dorbec,et al.  Power Domination in Product Graphs , 2008, SIAM J. Discret. Math..

[14]  Ashkan Aazami,et al.  Domination in graphs with bounded propagation: algorithms, formulations and hardness results , 2008, J. Comb. Optim..

[15]  Kang Li-ying,et al.  Power domination in planar graphs with small diameter , 2007 .

[16]  D. T. Lee,et al.  Power Domination Problem in Graphs , 2005, COCOON.

[17]  Stefan Richter,et al.  Parameterized power domination complexity , 2006, Inf. Process. Lett..

[18]  Min Zhao,et al.  Power domination in graphs , 2006, Discret. Math..