Zero Forcing of Generalized Hierarchical Products of Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913560820449280 |
|---|---|
| author | LeClair, Heather Spilde, Tim Anderson, Sarah Kroschel, Brenda |
| author_facet | LeClair, Heather Spilde, Tim Anderson, Sarah Kroschel, Brenda |
| contents | Zero forcing is a graph propagation process for which vertices fill-in (or propagate information to) neighbor vertices if all neighbors except for one, are filled. The zero-forcing number is the smallest number of vertices that must be filled to begin the process so that the entire graph or network becomes filled. In this paper, bounds are provided on the zero forcing number of generalized hierarchical products. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_17440 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Zero Forcing of Generalized Hierarchical Products of Graphs LeClair, Heather Spilde, Tim Anderson, Sarah Kroschel, Brenda Combinatorics 05C69, 05C57 Zero forcing is a graph propagation process for which vertices fill-in (or propagate information to) neighbor vertices if all neighbors except for one, are filled. The zero-forcing number is the smallest number of vertices that must be filled to begin the process so that the entire graph or network becomes filled. In this paper, bounds are provided on the zero forcing number of generalized hierarchical products. |
| title | Zero Forcing of Generalized Hierarchical Products of Graphs |
| topic | Combinatorics 05C69, 05C57 |
| url | https://arxiv.org/abs/2410.17440 |