Weakly convex and convex domination numbers
Magdalena Lemańska · DOAJ (DOAJ: Directory of Open Access Journals) · 2004
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.