Variants of the Domination Number for Flower Snarks

Abstract

We consider the flower snarks, a widely studied infinite family of 3-regular graphs. For the Flower snark Jn on 4n vertices, it is trivial to show that the domination number of Jn is equal to n. However, results are more difficult to determine for variants of domination. The Roman domination, weakly convex domination, and convex domination numbers have been determined for flower snarks in previous works. We add to this literature by determining the independent domination, 2-domination, total domination, connected domination, upper domination, secure Domination and weak Roman domination numbers for flower snarks.