Results 111 to 120 of about 25,772 (133)

Outer independent signed double Roman domination

Journal of Applied Mathematics and Computing, 2021
Suppose $$[3]=\{0,1,2,3\}$$ and $$[3^{-}]=\{-1,1,2,3\}$$ . An outer independent signed double Roman dominating function (OISDRDF) of a graph
Ahangar, H. Abdollahzadeh, Pour, F. Nahani, Chellali, M., Sheikholeslami, S. M.   +3 more
openaire   +3 more sources

New bounds on the outer-independent total double Roman domination number

Discrete Mathematics, Algorithms and Applications, 2023
A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying (i) if [Formula: see text] then there must be at least two neighbors assigned two under [Formula: see text] or one neighbor [Formula: see text] with [Formula: see text]; and (ii) if [Formula: see text] then [Formula: see text] must be ...
S. M. Sheikholeslami, L. Volkmann
openaire   +2 more sources

Outer Independent Double Roman Domination Stability in Graphs

Ars Combinatoria
An outer independent double Roman dominating function (OIDRDF) on a graph G is a function f : V ( G ) → { 0 , 1 , 2 , 3 } having the property that (i) if f ( v ) = 0 , then the vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f ( w ) = 3 , and if f ( v ) = 1 , then the vertex v must have at least one ...
Sheikholeslami, S. M., Esmaeili, M., Volkmann, L.   +2 more
openaire   +2 more sources

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., Chellali, M., Sheikholeslami, S. M.   +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, P. Venkata Subba Reddy, S. Arumugam, Jakkepalli Pavan Kumar   +3 more
openaire   +1 more source

Outer independent double Roman domination

Applied Mathematics and Computation, 2020
Seyed Mahmoud Sheikholeslami
exaly  

Double outer-independent domination number of graphs

Quaestiones Mathematicae, 2021
Abel Cabrera Martínez
exaly