| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949758 | Discrete Applied Mathematics | 2017 | 6 Pages |
Abstract
We show that the total domination number of a maximal outerplanar graph G is bounded above by n+k3, where n is the order of G and k is the number of vertices of degree 2. For k>n3, a better bound is given by 2(nâk)3. For k>n3, we improve the upper bound of n+k4 on the usual domination number.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Michael Dorfling, Johannes H. Hattingh, Elizabeth Jonck,