We give general lower bounds and upper bounds on the maximum degree of a -critical graph in terms of the order of . We also establish tighter sharp lower bounds on in terms of the order of for several families of -critical graphs, such as crown-graphs, claw-free graphs, and graphs with independence number .
Keywords: total domination, edge-critical, maximum degree, maximum or- der AMS subject classification: 05C99, 05C69