Authors: Paul Dorbec 1; Seethu Varghese 2; Ambat Vijayakumar 2
0009-0007-1179-6082##NULL##NULL
Paul Dorbec;Seethu Varghese;Ambat Vijayakumar
1 Laboratoire Bordelais de Recherche en Informatique
2 Cochin University of Science and Technology
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 γp,k(G−e), γp,k(G/e) and for γp,k(G−v) in terms of γp,k(G), and give examples for which these bounds are tight. We characterize all graphs for which γp,k(G−e)=γp,k(G)+1 for any edge e. We also consider the behaviour of the propagation radius of graphs by similar modifications.