آمار
| تعداد نشریات | 6 |
| تعداد شمارهها | 126 |
| تعداد مقالات | 1,600 |
| تعداد مشاهده مقاله | 1,808,904 |
| تعداد دریافت فایل اصل مقاله | 1,679,271 |
Weak signed total double Roman $k$-domination number of graphs | ||
| Communications in Combinatorics and Optimization | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 15 شهریور 1405 | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2026.31439.2851 | ||
| نویسندگان | ||
| Jafar Amjadi1؛ Zahra Nayebi1؛ Lutz Volkmann* 2 | ||
| 1Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran | ||
| 2RWTH Aachen University | ||
| چکیده | ||
| Let $k\ge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$. A weak signed total double Roman $k$-dominating function (WSTDRkDF) on a graph $G$ is defined as a function $f \colon V(G)\rightarrow\{-1,1,2,3\}$ satisfying the conditions that $\sum_{x\in N(v)}f(x)\ge k$ for each vertex $v\in V(G)$, where $N(v)$ is the neighborhood of $v$. The weight of a WSTDRkDF $f$ is $\omega(f)=\sum_{v\in V(G)}f(v)$. The weak signed total double Roman $k$-domination number $\gamma_{wstdR}^k(G)$ of $G$ is the minimum weight among all WSTDRkDF on $G$. In this paper we initiate the study of the weak signed total double Roman $k$-domination number of graphs, and we present different sharp bounds on $\gamma_{wstdR}^k(G)$. In addition, we determine the weak signed total double Roman $k$-domination number of some classes of graphs. | ||
| کلیدواژهها | ||
| Weak signed total double Roman $k$-dominating function؛ graphs؛ bounds | ||
|
آمار تعداد مشاهده مقاله: 1 |
||