论文信息 - Weakly convex and convex domination numbers

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 convex domination number equals the connected domination number.

Magdalena Lemańska

[1] Subramanian Arumugam,et al. On graphs with equal domination and connected domination numbers , 1999, Discret. Math..

[2] P. Duchet,et al. On Hadwiger''s number and stability number , 1982 .

[3] Norbert Polat. On isometric subgraphs of infinite bridged graphs and geodesic convexity , 2002, Discret. Math..

[4] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.