### Abstract

If G is a graph, then a sequence v_{1},…,v_{m} of vertices is a closed neighborhood sequence if for all 2≤i≤m we have N[v_{i}]⁄⊆∪_{j=1} ^{i−1}N[v_{j}], and it is an open neighborhood sequence if for all 2≤i≤m we have N(v_{i})⁄⊆∪_{j=1} ^{i−1}N(v_{j}). The length of a longest closed (open) neighborhood sequence is the Grundy (Grundy total) domination number of G. In this paper we introduce two similar concepts in which the requirement on the neighborhoods is changed to N(v_{i})⁄⊆∪_{j=1} ^{i−1}N[v_{j}] or N[v_{i}]⁄⊆∪_{j=1} ^{i−1}N(v_{j}). In the former case we establish a strong connection to the zero forcing number of a graph, while we determine the complexity of the decision problem in the latter case. We also study the relationships among the four concepts, and discuss their computational complexities.

Original language | English |
---|---|

Pages (from-to) | 66-77 |

Number of pages | 12 |

Journal | Discrete Optimization |

Volume | 26 |

DOIs | |

Publication status | Published - Nov 1 2017 |

### Fingerprint

### Keywords

- Graph products
- Grundy domination
- L-sequence
- Sierpiński graphs
- Z-sequence
- Zero forcing

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics
- Applied Mathematics

### Cite this

*Discrete Optimization*,

*26*, 66-77. https://doi.org/10.1016/j.disopt.2017.07.001