The double Roman domination number of generalized Sierpiński graphs
V. Maria Anu, Aparna Lakshmanan S · Discrete Mathematics Algorithms and Applications · 2020
In this paper, we study the double Roman domination number of generalized Sierpiński graphs [Formula: see text]. More precisely, we obtain a bound for the double Roman domination number of [Formula: see text]. We also find the exact value of [Formula: see text].