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

• Autorzy: Raczek J.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

dominating set; NP-completeness; distance; convex set

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2004
• Tom: Vol. 24, no. 2
• Strony: 189--196
• Opis fizyczny: Bibliogr. 3 poz., rys.

Twórcy

autor

Raczek J.

• Gdańsk University of Technology, Department of Mathematics, ul. Narutowicza 11/12, 80-952 Gdańsk, Poland,

Bibliografia

• [1] Haynes T.W., Hedetniemi S.T., Slater P. J.: Fundamentals of domination in graphs. New York, Basel, Hong Kong, Marcel Dekker Inc. 1998.
• [2] Ross K.A., Wright C.R. B.: Matematyka dyskretna. Warszawa, Wydawnictwo Naukowe PWN 1996.
• [3] Handbook of Discrete and Combinatorial Mathematics. Editor-in-Chief: Rosen K.H., London, Washington, D.C. CRC Press Boca Raton 2000.