# On the Double Roman Domination Number of Generalized Sierpinski Graphs

## TL;DR

This paper investigates the double Roman domination number in generalized Sierpinski graphs, providing bounds and exact values for specific cases, advancing understanding of domination parameters in fractal-like graph structures.

## Contribution

It offers new bounds for the double Roman domination number of generalized Sierpinski graphs and determines the exact value for a specific case, filling gaps in graph domination theory.

## Key findings

- Established bounds for $ ext{double Roman domination}$ in $S(G,t)$
- Calculated exact $ ext{double Roman domination number}$ for $S(K_{n}, 2)$
- Enhanced understanding of domination parameters in fractal graphs

## Abstract

In this paper, we study the double Roman domination number of generalized Sierpi\'{n}ski 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))$.