آمار
| تعداد نشریات | 6 |
| تعداد شمارهها | 129 |
| تعداد مقالات | 1,610 |
| تعداد مشاهده مقاله | 1,833,753 |
| تعداد دریافت فایل اصل مقاله | 1,702,687 |
Weak signed total double Roman $k$-domination number of graphs | ||
| Communications in Combinatorics and Optimization | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 15 شهریور 1405 اصل مقاله (526.14 K) | ||
| نوع مقاله: 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 | ||
| 2Institute for Geometry and Practical Mathematics, RWTH Aachen University, 52056 Aachen,Germany | ||
| چکیده | ||
| 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] H. Abdollahzadeh Ahangar, M.A. Henning, Y. Zhao, C. Löwenstein, and V. Samodivkin, Signed Roman domination in graphs, J. Comb. Optim. 27 (2014), 241–255. https://doi.org/10.1007/s10878-012-9500-0
2] J. Amjadi, S. Nazari-Moghaddam, S.M. Sheikholeslami, and L. Volkmann, On the signed Roman $k$-domination in graphs, Quaest. Math. 43 (2020), no. 8, 1065–1082. https://doi.org/10.2989/16073606.2019.1600068
[3] L. Asgharsharghi, R. Khoeilar, and S.M. Sheikholeslami, Signed strong Roman domination in graphs, Tamkang J. Math. 48 (2017), no. 2, 135–147. http://dx.doi.org/10.5556/j.tkjm.48.2017.2240
[4] M. Chellali, N. Jafari Rad, S.M. Sheikholeslami, and L. Volkmann, Roman domination in graphs, Topics in Domination in Graphs (T.W. Haynes, S.T. Hedetniemi, and M.A. Henning, eds.), Springer, Berlin/Heidelberg, 2020, pp. 365–409.
[5] M. Chellali, N. Jafari Rad, S.M. Sheikholeslami, and L. Volkmann, Varieties of Roman domination in graphs II, AKCE Int. J. Graphs Comb. 17 (2020), no. 3, 966–984. https://doi.org/10.1016/j.akcej.2019.12.001
[6] M. Chellali, N. Jafari Rad, S.M. Sheikholeslami, and L. Volkmann, Varieties of Roman domination in graphs, Structures of Domination in Graphs (T.W. Haynes, S.T. Hedetniemi, and M.A. Henning, eds.), Springer, Berlin/Heidelberg, 2021, pp. 273–307.
[7] T.W. Haynes, S.T. Hedetniemi, and M.A. Henning (eds.), Topics in Domination in Graphs, Developments in Mathematics, vol. 64, Springer, Cham, 2020.
[8] T.W. Haynes, S.T. Hedetniemi, and M.A. Henning (eds.), Structures of Domination in Graphs, Developments in Mathematics, vol. 66, Springer, Cham, 2021.
[9] L. Shahbazi, H. Abdollahzadeh Ahangar, R. Khoeilar, and S.M. Sheikholeslami, Bounds on signed total double Roman domination, Commun. Comb. Optim. 5 (2020), no. 2, 191–206. https://doi.org/10.22049/CCO.2020.26761.1140
[10] L. Shahbazi, H. Abdollahzadeh Ahangar, R. Khoeilar, and S.M. Sheikholeslami,, Signed total double Roman $k$-domination in graphs, Discrete Math. Algorithms Appl. 12 (2020), no. 1, 2050009. https://doi.org/10.1142/S1793830920500093
[11] L. Shahbazi, H. Abdollahzadeh Ahangar, and S.M. Sheikholeslami, Signed total double Roman dominating functions in graphs, AKCE Int. J. Graphs Comb. 21 (2024), no. 3, 294–301. https://doi.org/10.1080/09728600.2024.2357561
[12] S.M. Sheikholeslami, L. Volkmann, Y. Shang, and M. Esmaeili, More results on the signed total double Roman $k$-domination of graphs, submitted. | ||
|
آمار تعداد مشاهده مقاله: 30 تعداد دریافت فایل اصل مقاله: 37 |
||