Photo from wikipedia
In this note we present an alternative proof of the result by Dorfling et al. (Discrete Math 339(3):1180–1188, 2016) establishing that any maximal outerplanar graph of order $$n \ge 5$$n≥5 has… Click to show full abstract
In this note we present an alternative proof of the result by Dorfling et al. (Discrete Math 339(3):1180–1188, 2016) establishing that any maximal outerplanar graph of order $$n \ge 5$$n≥5 has a total dominating set of size at most $$\lfloor \frac{2n}{5}\rfloor $$⌊2n5⌋, apart from two exceptions. In addition, we briefly discuss a relation between total domination in maximal outerplanar graphs and the concept of watched guards in simple polygons.
Keywords:
maximal outerplanar;
outerplanar;
outerplanar graphs;
total dominating;
dominating sets
Journal Title: Graphs and Combinatorics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Graphs and Combinatorics
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!