A set D of a vertices in a graph G = (V,E) is said to be a total dominating set of G if every vertex in V is adjacent to some vertex in D. The total domination number of a graph G without isolated vertices is the minimum cardinality of a total dominating set. The total bondage number bt(G) of G is the minimum number of edges whose removal enlarges the total domination number. In this paper we determine the exact values of the total domination number and the total bondage number for mesh pyramid and WK-recursive mesh pyramid. © 2015 Academic Publications, Ltd.