Results 191 to 200 of about 64,476 (206)
Some of the next articles are maybe not open access.

Outer independent double Roman domination in unicyclic and bicyclic graphs

Ars Combinatoria
An outer independent double Roman dominating function (OIDRDF) of a graph \( G \) is a function \( f:V(G)\rightarrow\{0,1,2,3\} \) satisfying the following conditions: (i) every vertex \( v \) with \( f(v)=0 \) is adjacent to a vertex assigned 3 or at least two vertices assigned 2; (ii) every vertex \( v \) with \( f(v)=1 \) has a neighbor assigned 2 ...
Nazari-Moghaddam, S.   +2 more
openaire   +1 more source

Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs

International Journal of Foundations of Computer Science
Let [Formula: see text] be graph. For any function [Formula: see text], let [Formula: see text], [Formula: see text]. The function [Formula: see text] is called an outer-independent double Roman dominating function (OIDRDF) if the following conditions are satisfied.
Amit Sharma   +3 more
openaire   +1 more source

Independent double roman domination number of a tree in terms of its 2-independence number

Discrete Mathematics, Algorithms and Applications
Let [Formula: see text] be a simple graph. An independent double Roman dominating function (IDRDF) on a graph [Formula: see text] is a function [Formula: see text] having the property that first if [Formula: see text], then vertex [Formula: see text] has at least two neighbors assigned [Formula: see text] under [Formula: see text] or one neighbor ...
Halimeh Koulivand   +3 more
openaire   +1 more source

Double Roman Domination: A Survey

Mathematics, 2023
Darja Rupnik Poklukar, Janez Žerovnik
exaly  

Outer independent double Roman domination

Applied Mathematics and Computation, 2020
Seyed Mahmoud Sheikholeslami
exaly  

Double Roman domination

Discrete Applied Mathematics, 2016
Teresa W Haynes, Stephen T Hedetniemi
exaly  

Complexity of Roman {2}-domination and the double Roman domination in graphs

AKCE International Journal of Graphs and Combinatorics, 2020
Chakradhar Padamutham   +1 more
exaly  

On the double Roman domination in graphs

Discrete Applied Mathematics, 2017
Hossein Abdollahzadeh Ahangar   +2 more
exaly  

Signed double Roman domination in graphs

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

Home - About - Disclaimer - Privacy