| dc.description.abstract | Let G = (V,E) be a connected computer network, where a vertex represents a computer
and each edge between two vertices represents a cable connecting them. We consider a mathematical model of “computer virus” propagation on G, where computer
viruses are small computer programs that can infect computers. Consider the following repetitive process on G: Initially, each vertex is colored white (healthy) or
black (infected). The set of initial black vertices is called a seed. We assume that once a vertex becomes black, it remains black forever. At each discrete time step,
each white vertex is recolored by the color shared by the majority of vertices in its neighborhood, at the previous time step; in case of tie, it remains white. The process
runs until either all vertices become black or no additional white vertices can be infected. The minimum number of virus seeds for G is denoted by B(G). In this paper, we study B(G) for torus cordalis graphs G. Our work improves some results
of Flocchini, Lodi, Luccio, Pagli and Santoro (Dynamic monopolies in tori, Discrete Applied Mathematics 137 (2004) 197-212).
| en_US |