TY - JOUR
A2 - da Fonseca, C.
A2 - Wu, B.
A2 - Godbole, A. P.
A2 - Kelarev, A. V.
AU - Kazemi, Adel P.
PY - 2013
DA - 2013/11/17
TI - -Tuple Total Restrained Domination in Complementary Prisms
SP - 984549
VL - 2013
AB - In a graph G with δ(G)≥k≥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, BIMS], 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.
SN - null
UR - https://doi.org/10.1155/2013/984549
DO - 10.1155/2013/984549
JF - ISRN Combinatorics
PB - Hindawi Publishing Corporation
KW -
ER -