TY - JOUR
TI - -Tuple Total Domination in Complementary Prisms
VL - 2011
PY - 2011
DA - 2012/01/18
DO - 10.5402/2011/681274
UR - https://doi.org/10.5402/2011/681274
AB - Let be a positive integer, and let be a graph with minimum degree at least . In their study (2010), Henning and Kazemi defined the -tuple total domination number of as the minimum cardinality of a -tuple total dominating set of , which is a vertex set such that every vertex of is adjacent to at least vertices in it. If is the complement of , the complementary prism of is the graph formed from the disjoint union of and by adding the edges of a perfect matching between the corresponding vertices of and . In this paper, we extend
some of the results of Haynes et al. (2009) for the -tuple total domination number
and also obtain some other new results. Also we find the -tuple total domination number of the
complementary prism of a cycle, a path, or a complete multipartite graph.
JF - ISRN Discrete Mathematics
SN - xxxx-xxxx
PB - International Scholarly Research Network
SP - 681274
KW -
A2 - Wang, W.
AU - Kazemi, Adel P.
ER -