Let be an integer and be a simple and finite graph with vertex set . A signed double Roman -dominating function (SDRDF) on a graph is a function such that (i) every vertex with is adjacent to at least two vertices assigned a 2 or to at least one vertex with , (ii) every vertex with is adjacent to at least one vertex with and (iii) holds for any vertex .The weight of a SDRDF is , and the minimum weight of a SDRDF is the signed double Roman -domination number of .In this paper, we investigate the signed double Roman -domination number of trees. In particular, we present lower and upper bounds on for and classify all extremal trees.
Yang, Hong 1 ; Wu, Pu 1 ; Nazari-Moghaddam, Sakineh 1 ; Sheikholeslami, Seyed Mahmoud 1 ; Zhang, Xiaosong 1 ; Shao, Zehui 1 ; Tang, Yuan Yan 1
@article{RO_2019__53_2_627_0,
author = {Yang, Hong and Wu, Pu and Nazari-Moghaddam, Sakineh and Sheikholeslami, Seyed Mahmoud and Zhang, Xiaosong and Shao, Zehui and Tang, Yuan Yan},
title = {Bounds for signed double {Roman} k-domination in trees},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {627--643},
year = {2019},
publisher = {EDP Sciences},
volume = {53},
number = {2},
doi = {10.1051/ro/2018043},
mrnumber = {3959475},
zbl = {1440.05164},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2018043/}
}
TY - JOUR AU - Yang, Hong AU - Wu, Pu AU - Nazari-Moghaddam, Sakineh AU - Sheikholeslami, Seyed Mahmoud AU - Zhang, Xiaosong AU - Shao, Zehui AU - Tang, Yuan Yan TI - Bounds for signed double Roman k-domination in trees JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2019 SP - 627 EP - 643 VL - 53 IS - 2 PB - EDP Sciences UR - https://www.numdam.org/articles/10.1051/ro/2018043/ DO - 10.1051/ro/2018043 LA - en ID - RO_2019__53_2_627_0 ER -
%0 Journal Article %A Yang, Hong %A Wu, Pu %A Nazari-Moghaddam, Sakineh %A Sheikholeslami, Seyed Mahmoud %A Zhang, Xiaosong %A Shao, Zehui %A Tang, Yuan Yan %T Bounds for signed double Roman k-domination in trees %J RAIRO - Operations Research - Recherche Opérationnelle %D 2019 %P 627-643 %V 53 %N 2 %I EDP Sciences %U https://www.numdam.org/articles/10.1051/ro/2018043/ %R 10.1051/ro/2018043 %G en %F RO_2019__53_2_627_0
Yang, Hong; Wu, Pu; Nazari-Moghaddam, Sakineh; Sheikholeslami, Seyed Mahmoud; Zhang, Xiaosong; Shao, Zehui; Tang, Yuan Yan. Bounds for signed double Roman k-domination in trees. RAIRO - Operations Research - Recherche Opérationnelle, Tome 53 (2019) no. 2, pp. 627-643. doi: 10.1051/ro/2018043
[1] , , , and , Double roman trees. To appear in: Ars Combin. (2019). | MR | Zbl
[2] , , , and , Trees with double Roman domination number twice the domination number plus two. To appear in: Iran. J. Sci. Technol. Trans. A Sci. (2019). | MR
[3] , and , On the double Roman domination in graphs. Discrete Appl. Math. 232 (2017) 1–7. | MR | Zbl
[4] , and , Signed double Roman domination in graphs. Discrete Appl. Math. 257 (2019) 1–11. | MR | Zbl
[5] , , , and , Signed Roman domination in graphs. J. Comb. Optim. 27 (2014) 241–255. | MR | Zbl
[6] , , and , An upper bound on the double Roman domination number. J. Comb. Optim. 36 (2018). Doi: 10.1007/s10878-018-0286-6. | MR | Zbl
[7] , and , Double Roman domination. Discrete Appl. Math. 211 (2016) 23–29. | MR | Zbl
[8] , Signed domination in regular graphs. Discrete Math. 158 (1996) 287–293. | MR | Zbl
[9] and , Signed Roman k-domination in graphs. Graphs Combin. 32 (2016) 175–190. | MR | Zbl
[10] and , Signed Roman k-domination in trees. Discrete Appl. Math. 186 (2015) 98–105. | MR | Zbl
[11] , On the signed Roman edge k-domination in graphs. Commun. Comb. Optim. 2 (2017) 57–64. | MR | Zbl
[12] , , , and , On the signed Roman k-domination: complexity and thin torus graphs. Discrete Appl. Math. 233 (2017) 175–186. | MR | Zbl
[13] and , The signed Roman domatic number of a digraph. Electron. J. Graph Theory Appl. 3 (2015) 85–93. | MR | Zbl
[14] and , Signed Roman domination number in digraphs. J. Comb. Optim. 30 (2015) 456–467. | MR | Zbl
[15] , The double Roman domatic number of a graph. J. Combin. Math. Combin. Comput. 104 (2018) 205–215. | MR | Zbl
[16] , Double Roman domination and domatic numbers of graphs. Commun. Comb. Optim. 3 (2018) 71–77. | MR | Zbl
[17] , The signed Roman k-domatic number of a graph. Discrete Appl. Math. 180 (2015) 150–157. | MR | Zbl
[18] , Signed Roman k-domination in digraphs. Graphs Combin. 32 (2016) 1217–1227. | MR | Zbl
[19] , The signed Roman k-domatic number of digraphs. Aust. J. Combin. 64 (2016) 444–457. | MR | Zbl
[20] , , and , Double Roman domination in trees. Inform. Process. Lett. 134 (2018) 31–34. | MR | Zbl
Cité par Sources :





