Results 1 to 10 of about 2,551 (252)
Perfect double Roman domination of trees
For a graph G with vertex set V(G) and function f:V(G)→{0,1,2,3}, let Vi be the set of vertices assigned i by f. A perfect double Roman dominating function of a graph G is a function f:V(G)→{0,1,2,3} satisfying the conditions that (i) if u∈V0, then u is ...
TERESA W Haynes
exaly +2 more sources
Some of the next articles are maybe not open access.
Solving the minimum-cost double Roman domination problem
Central European Journal of Operations Research, 2023Ana Klobučar Barišić, R. Manger
semanticscholar +1 more source
Roman {3}-domination (double Italian domination)
Discrete Applied Mathematics, 2020Doost Ali Mojdeh, Lutz Volkmann
exaly
Research on the Double Roman Domination Numbers of Graph and Its Induced Subgraphs
Pure Mathematics, 2022openaire +1 more source
On the double Roman domination of graphs
Applied Mathematics and Computation, 2018Jun Yue, Meiqin Wei
exaly
Signed double Roman domination in graphs
Discrete Applied Mathematics, 2019Hossein Abdollahzadeh Ahangar +1 more
exaly
Double Roman Domination in Digraphs
Bulletin of the Malaysian Mathematical Sciences Society, 2017Guoliang Hao +2 more
exaly
Double Roman domination in trees
Information Processing Letters, 2018Xiujun Zhang, Zepeng Li, Huiqin Jiang
exaly
Global double Roman domination in graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2019Zehui Shao +2 more
exaly

