Grundy dominating sequences and zero forcing sets

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc, Sandi Klavžar, Gašper Košmrlj, Balázs Patkós, Z. Tuza, Máté Vizer

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

If G is a graph, then a sequence v1,…,vm of vertices is a closed neighborhood sequence if for all 2≤i≤m we have N[vi]⁄⊆∪j=1 i−1N[vj], and it is an open neighborhood sequence if for all 2≤i≤m we have N(vi)⁄⊆∪j=1 i−1N(vj). 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(vi)⁄⊆∪j=1 i−1N[vj] or N[vi]⁄⊆∪j=1 i−1N(vj). 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 languageEnglish
Pages (from-to)66-77
Number of pages12
JournalDiscrete Optimization
Volume26
DOIs
Publication statusPublished - 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

Brešar, B., Bujtás, C., Gologranc, T., Klavžar, S., Košmrlj, G., Patkós, B., Tuza, Z., & Vizer, M. (2017). Grundy dominating sequences and zero forcing sets. Discrete Optimization, 26, 66-77. https://doi.org/10.1016/j.disopt.2017.07.001