Results 221 to 230 of about 107,030 (250)
Some of the next articles are maybe not open access.
Outer independent signed double Roman domination
Journal of Applied Mathematics and Computing, 2021Suppose $$[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 +3 more
openaire +3 more sources
Trees with independent Roman domination number twice the independent domination number
Discrete Mathematics, Algorithms and Applications, 2015A Roman dominating function (RDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text].
Chellali, Mustapha, Rad, Nader Jafari
openaire +3 more sources
Outer independent Roman domination number of trees
2021Summary: A Roman dominating function (RDF) on a graph \(G=(V,E)\) is a function \(f:V\rightarrow\{0, 1, 2\}\) such that every vertex \(u\) for which \(f(u)=0\) is adjacent to at least one vertex \(v\) for which \(f(v)=2\). An RDF \(f\) is called an outer independent Roman dominating function (OIRDF) if the set of vertices assigned a 0 under \(f\) is an
Dehgardi, Nasrin, Chellali, M
openaire +2 more sources
Closed Formulas for the Independent (Roman) Domination Number of Rooted Product Graphs
Mediterranean Journal of Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cabrera-Martínez, Abel +1 more
openaire +3 more sources
Further results on the independent Roman domination number of graphs
Quaestiones Mathematicae, 2022Let f : V (G) → {0, 1, 2} be a function on a graph G with vertex set V (G). Let Vi = {v ∈ V (G) : f (v) = i} for every i ∈ {0, 1, 2}. The function f is said to be an independent Roman dominating function on G if V 1 ∪ V 2 is an independent set and for ...
Abel Cabrera Martínez +1 more
openaire +2 more sources
Algorithmic aspects of outer independent Roman domination in graphs
Discrete Mathematics, Algorithms and Applications, 2021Let [Formula: see text] be a connected graph. A function [Formula: see text] is called a Roman dominating function if every vertex [Formula: see text] with [Formula: see text] is adjacent to a vertex [Formula: see text] with [Formula: see text]. If further the set [Formula: see text] is an independent set, then [Formula: see text] is called an outer ...
Sharma, Amit +3 more
openaire +2 more sources
Trees with equal Roman {2}-domination number and independent Roman {2}-domination number
RAIRO - Operations Research, 2019A Roman {2}-dominating function (R{2}DF) on a graph G =(V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to either at least one vertex v with f(v) = 2 or two vertices v1, v2 with f(v1) = f(v2) = 1. The weight of an R{2}DF f is the value w(f) = ∑u∈Vf(u).
Pu Wu +3 more
openaire +2 more sources
Complexity Aspects of Variants of Independent Roman Domination in Graphs
Bulletin of the Iranian Mathematical Society, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chakradhar Padamutham +1 more
openaire +3 more sources
Outer independent double Roman domination
Applied Mathematics and Computation, 2020An outer independent double Roman dominating function (OIDRDF) of a graph G is a function h from V(G) to {0, 1, 2, 3} for which each vertex with label 0 is adjacent to a vertex with label 3 or at least two vertices with label 2, and each vertex with ...
H. Ahangar +2 more
semanticscholar +3 more sources
Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
International Journal of Foundations of Computer Science, 2021For a simple, undirected graph [Formula: see text], a function [Formula: see text] which satisfies the following conditions is called an outer-independent total Roman dominating function (OITRDF) of [Formula: see text] with weight [Formula: see text].
Amit Sharma, P. Venkata Subba Reddy
openaire +3 more sources