Total dominating sets in maximal outerplanar graphs
Magdalena Lemańska , Rita Zuazua , Paweł Żyliński
AbstractIn this note we present an alternative proof of the result by Dorfling et al. (DiscreteMath 339(3):1180–1188, 2016) establishing that any maximal outerplanar graph of order n ≥ 5 has a total dominating set of size at most [2n/5], apart from twoexceptions. In addition, we briefly discuss a relation between total domination in maximal outerplanar graphs and the concept of watched guards in simple polygons.
|Journal series||Graphs and Combinatorics, ISSN 0911-0119, (A 20 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||total domination, domination, outerplanar graph, watched guards|
|Score||= 20.0, 28-01-2020, ArticleFromJournal|
|Publication indicators||= 1; : 2017 = 1.092; : 2017 = 0.481 (2) - 2017=0.599 (5)|
|Citation count*||7 (2020-05-14)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.