On Grundy Total Domination Number in Product Graphs

A longest sequence ( , . . ., ) of vertices of a graph is a Grundy total dominating sequence of if for all , . The length of the sequence is called the Grundy total domination number of and denoted . In this paper, the Grundy total domination number is studied on four standard graph products. For th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discussiones Mathematicae. Graph Theory 2021-02, Vol.41 (1), p.225-247
Hauptverfasser: Brešar, Boštjan, Bujtás, Csilla, Gologranc, Tanja, Klavžar, Sandi, Košmrlj, Gašper, Marc, Tilen, Patkós, Balázs, Tuza, Zsolt, vizer, Máté
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A longest sequence ( , . . ., ) of vertices of a graph is a Grundy total dominating sequence of if for all , . The length of the sequence is called the Grundy total domination number of and denoted . In this paper, the Grundy total domination number is studied on four standard graph products. For the direct product we show that , conjecture that the equality always holds, and prove the conjecture in several special cases. For the lexicographic product we express in terms of related invariant of the factors and find some explicit formulas for it. For the strong product, lower bounds on are proved as well as upper bounds for products of paths and cycles. For the Cartesian product we prove lower and upper bounds on the Grundy total domination number when factors are paths or cycles.
ISSN:1234-3099
2083-5892
DOI:10.7151/dmgt.2184