The total domination number of a graph is the minimum size of a set S such that every vertex has a neighbor in S . We show that a maximal outerplanar graph of order n ? 5 has total domination number at most 2 n / 5 , apart from two exceptions, and this bound is best possible.
['Michael J. Dorfling', 'Johannes H. Hattingh', 'Elizabeth Jonck']
Total domination in maximal outerplanar graphs II