论文信息 - On the Double Roman Domination Number of Generalized Sierpinski Graphs

On the Double Roman Domination Number of Generalized Sierpinski Graphs

In this paper, we study the double Roman domination number of generalized Sierpinski graphs $S(G,t)$. More precisely, we obtain a bound for the double Roman domination number of $S(G, t)$. We also find the exact value of $\gamma_{dR}(S(K_{n}, 2))$.

S. Aparna Lakshmanan | V. Anu | V. Anu | Aparna S. Lakshmanan

[1] Vladimir Samodivkin,et al. Total Roman domination in graphs , 2016 .

[2] L. Volkmann. Double Roman domination and domatic numbers of graphs , 2018 .

[3] Sylvain Gravier,et al. Generalized Sierpiński graphs 1 , 2011 .

[4] S. Aparna Lakshmanan,et al. Double Roman domination number , 2018, Discret. Appl. Math..

[6] Guoliang Hao,et al. Double Roman Domination in Digraphs , 2019 .

[7] Fatemeh Ramezani,et al. On the Roman domination number of generalized Sierpinski graphs , 2016, 1605.06918.

[8] S. Klavžar,et al. Graphs S(n, k) and a Variant of the Tower of Hanoi Problem , 1997 .

[9] S. Klavžar,et al. 1-perfect codes in Sierpiński graphs , 2002, Bulletin of the Australian Mathematical Society.

[10] Seyed Mahmoud Sheikholeslami,et al. An upper bound on the double Roman domination number , 2018, J. Comb. Optim..

[11] Teresa W. Haynes,et al. Double Roman domination , 2016, Discret. Appl. Math..