An Application of Zero Forcing using Power Propagation Time
Abstract: Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed The K-zero forcing number of a graph G is the minimum cardinality of a K- zero forcing set of G. In this paper we determine the K-zero forcing number of CSK- pyramid networks denoted by CSKP_ ( (C, L)), for all positive values of k except for k = C 1, C 2, for which we give an upper bound. The kpropagation radius of a graph G is the minimum number of propagation steps needed to monitor the graph G over all minimum k-PDS. We give a relationship between the k-forcing and the k-power domination numbers of a graph that bounds one in terms of the other
Keywords: zero forcing, propagation time, CSK-pyramid, power domination
How to Cite?: Dr. S. Chandrasekaran, A. Sulthana, "An Application of Zero Forcing using Power Propagation Time", Volume 7 Issue 11, November 2018, International Journal of Science and Research (IJSR), Pages: 915-917, https://www.ijsr.net/getabstract.php?paperid=ART20192768, DOI: https://dx.doi.org/10.21275/ART20192768