Exact double domination in the generalized Sierpiński graphs | ||
| AUT Journal of Mathematics and Computing | ||
| دوره 7، شماره 2، 2026، صفحه 151-162 اصل مقاله (584.37 K) | ||
| نوع مقاله: Original Article | ||
| شناسه دیجیتال (DOI): 10.22060/ajmc.2024.23345.1251 | ||
| نویسندگان | ||
| Mahsa Khatibi؛ Ali Behtoei* | ||
| 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ń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)$. | ||
| کلیدواژهها | ||
| Domination؛ Exact double domination؛ Sierpiński؛ Generalized Sierpiński | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 424 تعداد دریافت فایل اصل مقاله: 77 |
||
| تعداد نشریات | 9 |
| تعداد شمارهها | 455 |
| تعداد مقالات | 5,773 |
| تعداد مشاهده مقاله | 8,414,155 |
| تعداد دریافت فایل اصل مقاله | 6,974,730 |