فهرست نشریات علمی دسترسی آزاد ایران

A subset $D$ of vertices of a simple graph ‎$‎G‎$ ‎is ‎an exact double dominating set if each vertex $v$ of $G$ is dominated by exactly two vertices of $D$‎, ‎i.e. $|N_G[v]\cap D|=2$‎, ‎in ‎which ‎‎$‎N_G[v]‎$ ‎is ‎the closed neighborhood of $v$ in ‎$‎G‎$‎.‎ The generalized Sierpiński graph $S(G,t)$ is a fractal-like graph that uses $G$ as a building block and can be constructed recursively in ‎$‎t‎$ ‎steps ‎from the base graph $G$. ‎In this paper we study and determine the existence of exact double dominating sets in generalized Sierpiński graphs $S(P_n,t),$‎ ‎$S(C_n,t),$‎ ‎$S(K_{1,n},t)$ and $S(K_n,t)$‎.