DMGT

ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

https://doi.org/10.7151/dmgt

Discussiones Mathematicae Graph Theory

IMPACT FACTOR 2019: 0.755

SCImago Journal Rank (SJR) 2019: 0.600

Rejection Rate (2018-2019): c. 84%

Discussiones Mathematicae Graph Theory

Article in press


Authors:

B. Brešar, Cs. Bujtás, T. Gologranc, S. Klavžar, G. Košmrlj, T. Marc, B. Patkós, Zs. Tuza, M. Vizer

Title:

On Grundy total domination number in product graphs

Source:

Discussiones Mathematicae Graph Theory

Received: 2018-02-27, Revised: 2018-09-26, Accepted: 2018-09-26, https://doi.org/10.7151/dmgt.2184

Abstract:

A longest sequence $(v_1,\ldots,v_k)$ of vertices of a graph $G$ is a Grundy total dominating sequence of $G$ if for all $i$, $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\emptyset$. The length $k$ of the sequence is called the Grundy total domination number of $G$ and denoted $\gamma_{gr}^{t}(G)$. In this paper, the Grundy total domination number is studied on four standard graph products. For the direct product we show that $\gamma_{gr}^t(G\times H) \geq \gamma_{gr}^t(G)\gamma_{gr}^t(H)$, conjecture that the equality always holds, and prove the conjecture in several special cases. For the lexicographic product we express $\ggrt(G\circ H)$ in terms of related invariant of the factors and find some explicit formulas for it. For the strong product, lower bounds on $\ggrt(G \boxtimes H)$ 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.

Keywords:

total domination, Grundy total domination number, graph product

PDF
Close