An Application of Zero Forcing using Power Propagation Time
Journal: International Journal of Science and Research (IJSR) (Vol.7, No. 11)Publication Date: 2018-11-05
Authors : S. Chandrasekaran; A. Sulthana;
Page : 915-917
Keywords : zero forcing; propagation time; CSK-pyramid; power domination;
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
Other Latest Articles
- Solar Kitchen
- Modeling and Simulation of Microclimate in Plant Factory
- Beneficial Effects of Probiotics on Human Health
- Community Empowerment and Adult Literacy through REFLECT Methodology: Lessons from Mumias, Kenya
- Health Teachings Rendered to Hemodialysis Patients as Perceived by Hemodialysis Patients and Staff Nurses
Last modified: 2021-06-28 20:21:18