机构:
Univ Autonoma Metropolitana, Dept Matemat Aplicadas & Sistemas, Ciudad De Mexico, MexicoUniv Autonoma Metropolitana, Dept Matemat Aplicadas & Sistemas, Ciudad De Mexico, Mexico
Hernandez-Ortiz, Rangel
[1
]
Pedro Montejano, Luis
论文数: 0引用数: 0
h-index: 0
机构:
Univ Rovira & Virgili, Dept Engn Informat & Matemat, Av Paisos Catalans 26, Tarragona 43007, SpainUniv Autonoma Metropolitana, Dept Matemat Aplicadas & Sistemas, Ciudad De Mexico, Mexico
Pedro Montejano, Luis
[2
]
Rodriguez-Velazquez, Juan Alberto
论文数: 0引用数: 0
h-index: 0
机构:
Univ Rovira & Virgili, Dept Engn Informat & Matemat, Av Paisos Catalans 26, Tarragona 43007, SpainUniv Autonoma Metropolitana, Dept Matemat Aplicadas & Sistemas, Ciudad De Mexico, Mexico
Rodriguez-Velazquez, Juan Alberto
[2
]
机构:
[1] Univ Autonoma Metropolitana, Dept Matemat Aplicadas & Sistemas, Ciudad De Mexico, Mexico
weak Roman domination;
NP-hard;
rooted product graphs;
corona product graphs;
protection of graphs;
PROTECTION;
NUMBER;
D O I:
10.3934/math.2021217
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In this paper, we obtain closed formulae for the weak Roman domination number of rooted product graphs. As a consequence of the study, we show that the use of rooted product graphs is a useful tool to show that the problem of computing the weak Roman domination number of a graph is NP-hard.