TY  - JOUR
ID  - Raczek2004
LB  - Raczek2004
AU  - Raczek, Joanna
TI  - NP-completeness of weakly convex and convex dominating set decision problems
ST  - NP-completeness of weakly convex and convex dominating set decision problems
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2004
VL  - 24
IS  - 2
SP  - 189
EP  - 196
DO  - http://dx.doi.org/10.7494/OpMath.2004.24.2.189
UR  - http://dx.doi.org/10.7494/OpMath.2004.24.2.189
AB  - 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 verify in polynomial time whether a given subset of vertices of a graph is convex or weakly convex.
KW  - dominating set
KW  - \(NP\)-completeness
KW  - distance
KW  - convex set
SN  - 1232-9274
ER  -