The Zero Forcing Numbers of Peony Graphs and Web Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914941433282560 |
|---|---|
| author | Anderton, Sara Mizozoe, Kanno Schuerger, Houston Schwartz, Andrew |
| author_facet | Anderton, Sara Mizozoe, Kanno Schuerger, Houston Schwartz, Andrew |
| contents | The concept of zero forcing involves a dynamic coloring process by which blue vertices cause white vertices to become blue, with the goal of forcing the entire graph blue while choosing as few as possible vertices to be initially blue. Past research in this area has focused on structural arguments, with approaches varying from graph substructures to the interplay between local and global graph structures. This paper explores the use of these structural concepts when determining the zero forcing number of complex classes of graphs, specifically two infinite classes of graphs each defined on multiple parameters. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_04717 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Zero Forcing Numbers of Peony Graphs and Web Graphs Anderton, Sara Mizozoe, Kanno Schuerger, Houston Schwartz, Andrew Combinatorics 05c50, 05c57, 05c69 The concept of zero forcing involves a dynamic coloring process by which blue vertices cause white vertices to become blue, with the goal of forcing the entire graph blue while choosing as few as possible vertices to be initially blue. Past research in this area has focused on structural arguments, with approaches varying from graph substructures to the interplay between local and global graph structures. This paper explores the use of these structural concepts when determining the zero forcing number of complex classes of graphs, specifically two infinite classes of graphs each defined on multiple parameters. |
| title | The Zero Forcing Numbers of Peony Graphs and Web Graphs |
| topic | Combinatorics 05c50, 05c57, 05c69 |
| url | https://arxiv.org/abs/2409.04717 |