\(k\)-tuple total restrained domination in complementary prisms (Q2449268): Difference between revisions

Summary: In a graph \(G\) with \(\delta(G)\geq k\geq 1\), a \(k\)-tuple total restrained dominating set \(S\) is a subset of \(V(G)\) such that each vertex of \(V(G)\) is adjacent to at least \(k\) vertices of \(S\) and also each vertex of \(V(G)-S\) is adjacent to at least \(k\) vertices of \(V(G)-S\). The minimum number of vertices of such sets in \(G\) is the \(k\)-tuple total restrained domination number of \(G\). In [``\(k\)-tuple total restrained domination/domatic in graphs'', Bull. Iranian Math. Sci. (to appear)], the author initiated the study of the \(k\)-tuple total restrained domination number in graphs. In this paper, we continue it in the complementary prism of a graph.