Power domination in regular claw-free graphs
Combinatorics
2018-08-09 v1
Abstract
In this paper, we first show that the power domination number of a connected -regular claw-free graph on vertices is at most , 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.
Cite
@article{arxiv.1808.02613,
title = {Power domination in regular claw-free graphs},
author = {Changhong Lu and Rui Mao and Bing Wang},
journal= {arXiv preprint arXiv:1808.02613},
year = {2018}
}