Total dominating sets in maximal outerplanar graphs
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.
- A combinatorial theorem in plane geometry
- Art gallery theorems for guarded guards.
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs
- Distance domination, guarding and covering of maximal outerplanar graphs
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 5058664 (Why is no real title available?)
- Monitoring maximal outerplanar graphs
- Total domination in maximal outerplanar graphs. II.
- Watched guards in art galleries
- Coupon-coloring and total domination in Hamiltonian planar triangulations
- On dominating sets of maximal outerplanar graphs
- Domination and outer connected domination in maximal outerplanar graphs
- Double domination in maximal outerplanar graphs
- Partial domination of maximal outerplanar graphs
- Total domination in plane triangulations
- Convex dominating sets in maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- Semipaired domination in maximal outerplanar graphs
- Extensions of the Art Gallery Theorem
- Distance domination, guarding and covering of maximal outerplanar graphs
- Total domination in maximal outerplanar graphs
- scientific article; zbMATH DE number 7690927 (Why is no real title available?)
- Secure total domination number in maximal outerplanar graphs
- Isolation of regular graphs and \(k\)-chromatic graphs
- Isolation of squares in graphs
- Disjunctive domination in maximal outerplanar graphs
- Solution to a 3-path isolation problem for subcubic graphs
- Isolation of regular graphs, stars and k-chromatic graphs
- Maximal outerplanar graphs with semipaired domination number double the domination number
- Proof of a conjecture on isolation of graphs dominated by a vertex
- Solution to a problem on isolation of 3-vertex paths
- Total domination in maximal outerplanar graphs. II.
- On dominating sets of maximal outerplanar and planar graphs
This page was built for publication: Total dominating sets in maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409534)
