Abstract
The contamination game of a grid graph G(n,m) is a dynamic variant of the domination, similar to the power domination. This standard is introduced by Haynes, Hedetniemi and Henning in 2002, which is initially defined as a basic domination for a set of vertices S in a graph G, and then a propagation of this domination in all vertices of G, while starting with S. On the other hand, the contamination phenomena in G(n,m) is interpreted by an evolutionary automaton cellular, which aims to propagate viruses according to a given propagation rules. In this paper, we define a mathematical self-playing game called a contamination game based on the power domination, in which, we identify the minimum number of contaminant cells for G(n,m), called the contamination number and denoted γ(G(n,m)).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
