| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646931 | Discrete Mathematics | 2016 | 9 Pages |
Abstract
The total domination number of a graph is the minimum size of a set SS such that every vertex has a neighbor in SS. We show that a maximal outerplanar graph of order n≥5n≥5 has total domination number at most 2n/52n/5, apart from two exceptions, and this bound is best possible.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michael Dorfling, Johannes H. Hattingh, Elizabeth Jonck,