NP-completeness of weakly convex and convex dominating set decision problems
The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \(NP\)-complete for bipartite and split graphs. Using a modified version of Warshall algorithm we can v...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2004-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol24/2/art/opuscula_math_2417.pdf |