Heredity for generalized power domination
Discrete Mathematics
2016-03-24 v1 Combinatorics
Abstract
In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We prove optimal bounds for , and for in terms of , and give examples for which these bounds are tight. We characterize all graphs for which for any edge . We also consider the behaviour of the propagation radius of graphs by similar modifications.
Cite
@article{arxiv.1603.07243,
title = {Heredity for generalized power domination},
author = {Paul Dorbec and Seethu Varghese and Ambat Vijayakumar},
journal= {arXiv preprint arXiv:1603.07243},
year = {2016}
}
Comments
Discrete Mathematics and Theoretical Computer Science, 2016