Downloads: 140
Research Paper | Mathematics | India | Volume 7 Issue 11, November 2018
An Application of Zero Forcing using Power Propagation Time
Dr. S. Chandrasekaran [10] | A. Sulthana [3]
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
Edition: Volume 7 Issue 11, November 2018,
Pages: 915 - 917
Similar Articles with Keyword 'zero forcing'
Downloads: 111
Research Paper, Mathematics, India, Volume 7 Issue 9, September 2018
Pages: 313 - 316Zeroforcing and Power Domination for a Graph of Cartesian Products of Two Cycles m ? n ? 3
Dr. S. Chandrasekaran [10] | A. Sulthana [3]
Downloads: 180
Research Paper, Mathematics, India, Volume 7 Issue 10, October 2018
Pages: 233 - 235An Application of Power Domination of Zero Forcing
Dr. S. Chandrasekaran [10] | A. Sulthana [3]