Results 171 to 174 of about 4,764 (174)
Some of the next articles are maybe not open access.
Given a graph G, a set S ⊆ V (G) is called a zero forcing set if repeatedly applying the following colour change rule results in all vertices of G being coloured black: if a black vertex v has exactly one white neighbour u, then u becomes black. The zero forcing number Z(G) is the size of the smallest zero forcing set of G.
openaire +1 more source
openaire +1 more source
Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes
Journal of Applied Mathematics and ComputingFatemeh Afzali +2 more
openaire +2 more sources