Grundy dominating sequences and zero forcing sets
DOI10.1016/j.disopt.2017.07.001zbMath1387.05177arXiv1702.00828OpenAlexW2595660128WikidataQ59072360 ScholiaQ59072360MaRDI QIDQ1751247
Tanja Gologranc, Csilla Bujtás, Boštjan Brešar, Balázs Patkós, Sandi Klavžar, Gašper Košmrlj, Zsolt Tuza, Máté Vizer
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.00828
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (23)
Cites Work
- Unnamed Item
- Unnamed Item
- Total dominating sequences in graphs
- Propagation time for zero forcing on a graph
- Generalized power domination of graphs
- Upper bounds on the \(k\)-forcing number of a graph
- Dominating sequences in grid-like and toroidal graphs
- A survey and classification of Sierpiński-type graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Dominating sequences in graphs
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Total dominating sequences in trees, split graphs, and under modular decomposition
- The relationship between \(k\)-forcing and \(k\)-power domination
- On the relationships between zero forcing numbers and certain graph coverings
- Generalized power domination: propagation radius and Sierpiński graphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- Zero forcing sets and the minimum rank of graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Domination in Graphs Applied to Electric Power Networks
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- Power domination with bounded time constraints
This page was built for publication: Grundy dominating sequences and zero forcing sets