paper

Double Total Domination in Harary Graphs

arXiv:1603.02430

Abstract

Let be a graph with minimum degree at least 2. A set is a double total dominating set of if each vertex is adjacent to at least two vertices in . The double total domination number of is the minimum cardinality of a double total dominating set of . In this paper, we will find double total domination number of Harary graphs.