تعداد نشریات | 7 |
تعداد شمارهها | 399 |
تعداد مقالات | 5,389 |
تعداد مشاهده مقاله | 5,288,178 |
تعداد دریافت فایل اصل مقاله | 4,882,913 |
Exact double domination in the generalized Sierpinski graphs | ||
AUT Journal of Mathematics and Computing | ||
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 03 دی 1403 | ||
نوع مقاله: Original Article | ||
شناسه دیجیتال (DOI): 10.22060/ajmc.2024.23345.1251 | ||
نویسندگان | ||
Ali Behtoei* ؛ Mahsa Khatibi | ||
Department of Mathematics, Faculty of Science, Imam Khomeini International University, Qazvin, Iran | ||
چکیده | ||
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'{n}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'nski graphs $S(P_n,t)$, $S(C_n,t)$, $S(K_{1,n},t)$ and $S(K_n,t)$. | ||
کلیدواژهها | ||
Domination؛ Exact double domination؛ Sierpi\'{n}ski؛ Generalized Sierpi\'{n}ski | ||
آمار تعداد مشاهده مقاله: 33 |