Variants of the domination number for flower snarks

Research output: Contribution to journalArticlepeer-review

48 Downloads (Pure)


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.
Original languageEnglish
Number of pages28
JournalArs Mathematica Contemporanea
Publication statusAccepted/In press - 14 Jul 2023


  • Flower
  • snarks
  • domination
  • variants
  • secure


Dive into the research topics of 'Variants of the domination number for flower snarks'. Together they form a unique fingerprint.

Cite this