Bounds on the propagation radius in power domination

Let G be a graph and let S V (G). It is said that S dominates NS. We say that S monitors vertices of G as follows. Initially, all dominated vertices are monitored. If there exists a vertex v G which is not monitored, but has all but one of its neighbours monitored, then v becomes monitored itself. This step is called a propagation step and is repeated until the process terminates. The process terminates when the there are no unmonitored vertices with exactly one unmonitored neighbour. This combined process of initial domination and subsequent propagation is called power domination. If all vertices of G are monitored at termination, then S is said to be a power dominating set (PDS) of G. The power domination number of G, denoted as γₚ (G), is the minimum cardinality of a PDS of G. The propagation radius of G is the minimum number of steps it takes a minimum PDS to monitor V (G). In this paper we determine an upper bound on the propagation radius of G with regards to power domination, in terms of δ and n. We show that this bound is only attained when γₚ (G) =1 and then improve this bound for γₚ (G) 2. Sharpness examples for these bounds are provided. We also present sharp upper bounds on the propagation radius of split graphs. We present sharpness results for a known lower bound of the propagation radius for all Δ 3.