Power domination in regular claw-free graphs

In this paper, we first show that the power domination number of a connected $4$-regular claw-free graph on $n$ vertices is at most $\frac{n+1}{5}$, and the bound is sharp. The statement partly disprove the conjecture presented by Dorbec et al. in SIAM J. Discrete Math., 27:1559-1574, 2013. Then we present a dynamic programming style linear-time algorithm for weighted power domination problem in trees.

[1]  Hong-Gwa Yeh,et al.  Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs , 1998, Discret. Appl. Math..

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

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

[4]  C. Pandu Rangan,et al.  Total Domination in Interval Graphs Revisited , 1988, Inf. Process. Lett..

[5]  Alan A. Bertossi,et al.  Total Domination and Irredundance in Weighted Interval Graphs , 1988, SIAM J. Discret. Math..

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

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

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

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

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

[11]  André Raspaud,et al.  Generalized power domination of graphs , 2012, Discret. Appl. Math..

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

[13]  Gerard J. Chang,et al.  The weighted independent domination problem is NP-complete for chordal graphs , 2004, Discret. Appl. Math..

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

[15]  André Raspaud,et al.  Generalized Power Domination in Regular Graphs , 2013, SIAM J. Discret. Math..

[16]  W. Haemers.  Zero forcing sets and minimum rank of graphs , 2008 .

[17]  Stephen T. Hedetniemi,et al.  Linear algorithms on k-terminal graphs , 1987 .

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

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

[20]  Chao Wang,et al.  $$k$$k-Power domination in block graphs , 2016, J. Comb. Optim..

[21]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[22]  Lee J. White,et al.  Optimum Domination in Weighted Trees , 1978, Inf. Process. Lett..

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

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