The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Target set selection problem for honeycomb networks
[article]

2012
*
arXiv
*
pre-print

Let G be a graph with a threshold function θ:V(G)→N such that 1≤θ(v)≤ d_G(v) for every vertex v of G, where d_G(v) is the degree of v in G. Suppose we are given a target set S⊆ V(G). The paper considers the following repetitive process on G. At time step 0 the vertices of S are colored black and the other vertices are colored white. After that, at each time step t>0, the colors of white vertices (if any) are updated according to the following rule. All white vertices v that have at least θ(v)

arXiv:1203.0666v1
fatcat:3t2475ml3fceph3ie6p6a7xlvm