Let denote the total domination number of the graph . A graph is said to be total domination edge critical, or simply -critical, if for each edge . We show that, for -critical graphs , that is, -critical graphs with , the diameter of is either , , or . Further, we characterize structurally the -critical graphs with .
Keywords: diameter, total domination, edge addition, edge critical, extremal graphs