The convex and weak convex domination number of convex polytopes

Abstract

This paper is devoted to solving the weakly convex dominating set problem and the convex dominating set problem for some classes of planar graphs-convex polytopes. We consider all classes of convex polytopes known from the literature and present exact values of weakly convex and convex domination number for all classes, namely

Variants of the domination number for flower snarks

“…Theorem 1.5 ([25, Maksimovic et al (2018)], [22, Kratica et al (2020)]). Consider the flower snark J n , for n ≥ 3.…”