On Grundy total domination number in product graphs

DOI10.7151/dmgt.2184zbMath1453.05085arXiv1712.08780OpenAlexW2963027346WikidataQ128836832 ScholiaQ128836832MaRDI QIDQ2214319

Sandi Klavžar, Gašper Košmrlj, Zsolt Tuza, Boštjan Brešar, Máté Vizer, Balázs Patkós, Tanja Gologranc, Tilen Marc, Csilla Bujtás

Publication date: 8 December 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.08780

zbMATH Keywords

total dominationGrundy total domination numbergraph product

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Grundy domination of forests and the strong product conjecture ⋮ On the L-Grundy domination number of a graph ⋮ On graphs all of whose total dominating sequences have the same length ⋮ On graphs with equal total domination and Grundy total domination numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Total dominating sequences in graphs
• Failed skew zero forcing on a graph
• Dominating sequences in grid-like and toroidal graphs
• Dominating sequences in graphs
• Minimum rank of skew-symmetric matrices described by a graph
• 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
• Zero forcing sets and the minimum rank of graphs
• On graphs of minimum skew rank 4
• Vizing's conjecture: a survey and recent results
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Total Domination in Graphs

This page was built for publication: On Grundy total domination number in product graphs