Opuscula Math. 24, no. 2 (2004), 189-196

Opuscula Mathematica

# NP-completeness of weakly convex and convex dominating set decision problems

Joanna Raczek

Abstract. 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.

Keywords: dominating set, $$NP$$-completeness, distance, convex set.

Mathematics Subject Classification: 05C69, 05C85.

Full text (pdf)

• Joanna Raczek
• Gdańsk University of Technology, Department of Mathematics, ul. Narutowicza 11/12, 80-952 Gdańsk, Poland
• Received: 2003-11-04.

Cite this article as:
Joanna Raczek, NP-completeness of weakly convex and convex dominating set decision problems, Opuscula Math. 24, no. 2 (2004), 189-196

Download this article's citation as:
a .bib file (BibTeX),
a .ris file (RefMan),
a .enw file (EndNote)
or export to RefWorks.

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.