Journal of Information Science and Engineering, Vol. 40 No. 2, pp. 253-264

Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions

Given a graph *G*, a 2-tuple total dominating set is a vertex subset *S* such that every vertex has at least two neighbors in *S*. The cardinality of a minimum 2-tuple total dominating set is called the 2-tuple total domination number. In this paper, we determine the 2-tuple total domination numbers of *H** _{m,n}* for

Keywords:
graph theory, domination, 2-tuple total domination, regular graphs, Harary graphs