| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 434805 | Theoretical Computer Science | 2012 | 8 Pages |
Abstract
Let G=(V,E) be a simple graph. A vertex set S⊆V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V−S. In this paper, we investigate the NP-completeness of the restrained domination problem in planar graphs and split graphs. Meanwhile, it is proved that the restrained domination problem is APX-complete for bounded-degree graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
