Opuscula Mathematica
Opuscula Math. 24, no. 2 (2004), 181-188

Weakly convex and convex domination numbers

Magdalena Lemańska
Abstract. Two new domination parameters for a connected graph \(G\): the weakly convex domination number of \(G\) and the convex domination number of \(G\) are introduced. Relations between these parameters and the other domination parameters are derived. In particular, we study for which cubic graphs the convex domination number equals the connected domination number.
Keywords: dominating set, connected domination number, distance, isometric set, convex set.
Mathematics Subject Classification: 05C12, 05C69, 05C99.
Full text (pdf)
About the authors ▼
Magdalena Lemańska
Gdańsk University of Technology, Department of Mathematics, ul. Narutowicza 11/12, 80-952 Gdańsk, Poland
About the article ▼
Received: 2003-11-04.
Cite this article as ▼
Magdalena Lemańska, Weakly convex and convex domination numbers, Opuscula Math. 24, no. 2 (2004), 181-188, http://dx.doi.org/10.7494/OpMath.2004.24.2.181.
Download this article's citation as: