Results 31 to 40 of about 2,551 (252)
Double Roman Domination in Generalized Petersen Graphs P(ck, k)
Symmetry, 2022 A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3}, satisfying the condition that every vertex u for which f(u)=1 is adjacent to at least one vertex assigned 2 or 3, and every vertex u with f(u)=0 is adjacent to at least ...
D. R. Poklukar, J. Žerovnik
semanticscholar +2 more sources
On the Double Roman Domination in Generalized Petersen Graphs P(5k,k)
Mathematics, 2022 A double Roman dominating function on a graph G=(V,E) is a function f:V→{0,1,2,3} satisfying the condition that every vertex u for which f(u)=0 is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and every vertex u with f(u)
Darja Rupnik Poklukar, Janez Žerovnik
doaj +2 more sources
Complexity of Roman {2}-domination and the double Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a simple, undirected graph a Roman {2}-dominating function (R2DF) has the property that for every vertex with f(v) = 0, either there exists a vertex with f(u) = 2, or at least two vertices with The weight of an R2DF is the sum The minimum weight of ...
Padamutham Chakradhar +1 more
exaly +2 more sources
Perfect double Italian domination of a graph
AKCE International Journal of Graphs and Combinatorics, 2023 For a graph [Formula: see text] with [Formula: see text] and [Formula: see text], a perfect double Italian dominating function is a function [Formula: see text] having the property that [Formula: see text], for every vertex [Formula: see text] with ...
Guoliang Hao +2 more
doaj +2 more sources
On the Outer-Independent Double Roman Domination of Graphs
Frontiers in Applied Mathematics and Statistics, 2021 An outer-independent double Roman dominating function (OIDRDF) of a graph G is a function h : V ( G ) → { 0,1,2,3 } such that i) every vertex v with f ( v ) = 0 is adjacent to at least one vertex with label 3 or to at least two vertices with label 2, ii)
Yongsheng Rao +4 more
semanticscholar +3 more sources
On the Total Double Roman Domination
IEEE Access, 2019 Let G = (V, E) be a simple graph. A double Roman dominating function (DRDF) on G is a function f from the vertex set V of G into {0, 1, 2, 3} such that if f (u) = 0, then u must have at least two neighbors assigned 2 or one neighbor assigned 3 under f ...
Zehui Shao +2 more
exaly +3 more sources
Independent double Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a graph G = (V,E), a double Roman dominating function has the property that for every vertex with f(v) = 0, either there exists a vertex , with f(u) = 3, or at least two neighbors having f(x) = f(y) = 2, and every vertex with value 1 under f has at ...
H R Maimani, S M Sheikholeslami
exaly +2 more sources
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rana Khoeilar +3 more
openaire +3 more sources
On Two Outer Independent Roman Domination Related Parameters in Torus Graphs
Mathematics, 2022 In a graph G=(V,E), where every vertex is assigned 0, 1 or 2, f is an assignment such that every vertex assigned 0 has at least one neighbor assigned 2 and all vertices labeled by 0 are independent, then f is called an outer independent Roman dominating ...
Hong Gao +3 more
doaj +2 more sources
Quasi total double Roman domination in graphs
AKCE International Journal of Graphs and CombinatoricsA quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w
Saeed Kosari +2 more
exaly +3 more sources