On the L-Grundy domination number of a graph

DOI10.2298/FIL2010205BzbMath1499.05448OpenAlexW3138995934MaRDI QIDQ5081167

Tim Kos, Michael A. Henning, Boštjan Brešar, Tanja Gologranc

Publication date: 13 June 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil2010205b

zbMATH Keywords

regular graphssplit graphsGrundy total domination numberforestsL-Grundy domination number

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

On the length of L-Grundy sequences

Cites Work

• Total dominating sequences in graphs
• Total version of the domination game
• Dominating sequences in grid-like and toroidal graphs
• Dominating sequences in graphs
• Grundy dominating sequences on \(X\)-join product
• Total dominating sequences in trees, split graphs, and under modular decomposition
• Zero forcing number, Grundy domination number, and their variants
• Grundy dominating sequences and zero forcing sets
• On Grundy total domination number in product graphs
• Zero forcing sets and the minimum rank of graphs
• Total domination in graphs
• Total Domination in Graphs
• Grundy domination and zero forcing in Kneser graphs
• Dominating sequences under atomic changes with applications in Sierpiński and interval graphs

This page was built for publication: On the L-Grundy domination number of a graph