Zero forcing irredundant sets
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914430211588096 |
|---|---|
| author | Curtis, Bryan A. Hogben, Leslie Roux, Adriana |
| author_facet | Curtis, Bryan A. Hogben, Leslie Roux, Adriana |
| contents | Irredundance has been studied in the context of dominating sets, via the concept of private neighbor. Here irredundance of zero forcing sets is introduced via the concept of a private fort and the upper and lower zero forcing irrdedundance numbers $\mbox{ZIR}(G)$ and $\mbox{zir}(G)$ are defined. Bounds on $\mbox{ZIR}(G)$ and $\mbox{zir}(G)$ are established and graphs having extreme values of $\mbox{ZIR}(G)$ and $\mbox{zir}(G)$ are characterized. The effect of the join and corona operations is studied. As the concept of a zero forcing irrdedundant set is new, there are many questions for future research. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_03921 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Zero forcing irredundant sets Curtis, Bryan A. Hogben, Leslie Roux, Adriana Combinatorics Irredundance has been studied in the context of dominating sets, via the concept of private neighbor. Here irredundance of zero forcing sets is introduced via the concept of a private fort and the upper and lower zero forcing irrdedundance numbers $\mbox{ZIR}(G)$ and $\mbox{zir}(G)$ are defined. Bounds on $\mbox{ZIR}(G)$ and $\mbox{zir}(G)$ are established and graphs having extreme values of $\mbox{ZIR}(G)$ and $\mbox{zir}(G)$ are characterized. The effect of the join and corona operations is studied. As the concept of a zero forcing irrdedundant set is new, there are many questions for future research. |
| title | Zero forcing irredundant sets |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2403.03921 |