Graphs with unique Grundy dominating sets
From MaRDI portal
Cites work
- A lower bound on the zero forcing number
- Dominating sequences in graphs
- Domination games played on graphs
- Graphs whose vertex independence number is unaffected by single edge addition or deletion
- Graphs with unique maximum independent sets
- Graphs with unique maximum packing of closed neighborhoods
- Grundy dominating sequences and zero forcing sets
- Grundy dominating sequences on X-join product
- scientific article; zbMATH DE number 841590 (Why is no real title available?)
- Null decomposition of trees
- On graphs all of whose total dominating sequences have the same length
- On graphs with equal total domination and Grundy total domination numbers
- On the L-Grundy domination number of a graph
- On the length of L-Grundy sequences
- On the maximum number of minimum dominating sets in forests
- On the maximum number of minimum total dominating sets in forests
- Propagation time for zero forcing on a graph
- Total dominating sequences in graphs
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Trees with unique minimum total dominating sets
- Uniform length dominating sequence graphs
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Zero forcing number, Grundy domination number, and their variants
- Zero forcing parameters and minimum rank problems
- Zero forcing sets and the minimum rank of graphs
This page was built for publication: Graphs with unique Grundy dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296458)
