On the L-Grundy domination number of a graph
From MaRDI portal
Publication:5081167
Recommendations
- On the domination number of a graph
- On the domination number of some graphs
- On the domination number of some graphs
- Bounds on the l-total k-domatic number of a graph
- On the total domination number of graphs
- On the domination number of a graph and its total graph
- On the \(r\)-domination number of a graph
- On f-domination number of a graph
- On the Grundy number of a graph
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
Cites work
- Dominating sequences in graphs
- Dominating sequences in grid-like and toroidal graphs
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- Grundy dominating sequences and zero forcing sets
- Grundy dominating sequences on X-join product
- Grundy domination and zero forcing in Kneser graphs
- On Grundy total domination number in product graphs
- Total dominating sequences in graphs
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Total domination in graphs
- Total domination in graphs
- Total version of the domination game
- Zero forcing number, Grundy domination number, and their variants
- Zero forcing sets and the minimum rank of graphs
Cited in
(2)
This page was built for publication: On the L-Grundy domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081167)