Results 1 to 10 of about 2,551 (252)

Perfect double Roman domination of trees

open access: yesDiscrete Applied Mathematics, 2020
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.

Double Roman Domination: A Survey

Mathematics, 2023
Darja Rupnik Poklukar   +2 more
exaly  

Solving the minimum-cost double Roman domination problem

Central European Journal of Operations Research, 2023
Ana Klobučar Barišić, R. Manger
semanticscholar   +1 more source

Roman {3}-domination (double Italian domination)

Discrete Applied Mathematics, 2020
Doost Ali Mojdeh, Lutz Volkmann
exaly  

On the double Roman domination of graphs

Applied Mathematics and Computation, 2018
Jun Yue, Meiqin Wei
exaly  

Signed double Roman domination in graphs

Discrete Applied Mathematics, 2019
Hossein Abdollahzadeh Ahangar   +1 more
exaly  

Double Roman Domination in Digraphs

Bulletin of the Malaysian Mathematical Sciences Society, 2017
Guoliang Hao   +2 more
exaly  

Double Roman domination in trees

Information Processing Letters, 2018
Xiujun Zhang, Zepeng Li, Huiqin Jiang
exaly  

Global double Roman domination in graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2019
Zehui Shao   +2 more
exaly  

Home - About - Disclaimer - Privacy