An Algorithm for 2-Tuple Total Domination Number in Circulant Graphs

This paper studies perfect 2-tuple total domination number for the circulant graphs Cir(n,A), where A={1,2,...,x,n-1,n-2,...n-x} and x<=floor((n-1)/2) from an algorithmic point of view.