Domination in the Sierpi\'nski graphs S(Kn,t)
Abstract
Different types of domination on the Sierpi\'nski graphs S(Kn,t) will be studied in this paper. More precisely, we propose a minimal dominating set for S(Kn,t) so that the exact values of their domination numbers, Roman domination numbers, and double Roman domination numbers are given. As applications, some previous bounds and results are confirmed to be tight and further generalized.
0