2025/08/13 by Lin, Hau-Yi, Wu-Hsiung Lin, Lin, Wu-Hsiung +1
Computer Science · Mathematics · #05C69 #05C85 #68R10 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.2508.09873
openalex publication_date 2025/08/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In a zero forcing process, vertices of a graph are colored black and white initially, and if there exists a black vertex adjacent to exactly one white vertex, then the white vertex is forced to be black. A zero blocking set is an initial set of white vertices in a zero forcing process such that ultimately there exists a white vertex. The zero blocking number is the minimum size of a zero blocking set. This paper gives the exact value of the zero blocking number of grid graphs.