Let G = (V, E) be a graph; a set S V is a total k-domination number (G) is the minimum cardinality among all total k-dominating sets. In this paper we obtain several tight bounds for the total k-domination number of a ...