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 verify in polynomial time whether a given subset of vertices of a graph is convex or weakly convex.
[1] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.