Weakly convex and convex domination numbers
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 con...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH Univeristy of Science and Technology Press
2004-01-01
|
Series: | Opuscula Mathematica |
Subjects: | |
Online Access: | http://www.opuscula.agh.edu.pl/vol24/2/art/opuscula_math_2416.pdf |