The zero blocking numbers of grid graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908488015282176 |
|---|---|
| author | Lin, Hau-Yi Lin, Wu-Hsiung Chang, Gerard Jennhwa |
| author_facet | Lin, Hau-Yi Lin, Wu-Hsiung Chang, Gerard Jennhwa |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_09873 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The zero blocking numbers of grid graphs Lin, Hau-Yi Lin, Wu-Hsiung Chang, Gerard Jennhwa Combinatorics 05C69, 05C85, 68R10 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. |
| title | The zero blocking numbers of grid graphs |
| topic | Combinatorics 05C69, 05C85, 68R10 |
| url | https://arxiv.org/abs/2508.09873 |