Total dominating sets in maximal outerplanar graphs (Q2409534): Difference between revisions

A set \(D\subseteq V(G)\) is a total domination set of graph \(G\) if every vertex from \(V(G)\) has a neighbor in \(D\). The minimum cardinality of a total domination set of \(G\) is called total domination number and is denoted by \(\gamma_t(G)\). A recent result from \textit{M. Dorfling} et al. [Discrete Math. 339, No. 3, 1180--1188 (2016 Zbl 1328.05140)] states that \(\gamma_t(G)\leq \left\lfloor \frac{2n}{5}\right\rfloor\) holds for all maximal outerplanar graphs on at least 5 vertices with two exceptions, each on 12 vertices. This work brings an alternative (short) proof of the result mentioned above. The authors use an approach that is common for the concept of watched guards in simple polygons. Also, the discussion about the connection between maximal outerplanar graphs and watched guards in simple polygons is presented.