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

zbMATH Keywords

graph productsSierpiński graphszero forcingGrundy dominationZ-sequenceL-sequence

Mathematics Subject Classification ID

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)

On the zero forcing number and spectral radius of graphs ⋮ Grundy domination of forests and the strong product conjecture ⋮ Uniform length dominating sequence graphs ⋮ On the L-Grundy domination number of a graph ⋮ On the length of L-Grundy sequences ⋮ Graphs with equal Grundy domination and independence number ⋮ On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme ⋮ Z-domination game ⋮ Computation of Grundy dominating sequences in (co-)bipartite graphs ⋮ Unnamed Item ⋮ Zero forcing number, Grundy domination number, and their variants ⋮ On Grundy total domination number in product graphs ⋮ Grundy domination and zero forcing in regular graphs ⋮ Brushing number and zero-forcing number of graphs and their line graphs ⋮ The variety of domination games ⋮ On graphs all of whose total dominating sequences have the same length ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Grundy domination and zero forcing in Kneser graphs ⋮ Zero forcing in claw-free cubic graphs ⋮ Power Domination in Graphs ⋮ Grundy dominating sequences on \(X\)-join product ⋮ GRUNDY DOMINATION SEQUENCES IN GENERALIZED CORONA PRODUCTS OF GRAPHS ⋮ Vertex sequences in graphs

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