English

On the Double Roman Domination Number of Generalized Sierpinski Graphs

Combinatorics 2019-08-20 v1

Abstract

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

Keywords

Cite

@article{arxiv.1908.06858,
  title  = {On the Double Roman Domination Number of Generalized Sierpinski Graphs},
  author = {Anu V. and Aparna Lakshmanan S.},
  journal= {arXiv preprint arXiv:1908.06858},
  year   = {2019}
}