Results 201 to 210 of about 405 (227)
Some of the next articles are maybe not open access.
Double Roman Domination in Digraphs
Bulletin of the Malaysian Mathematical Sciences Society, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guoliang Hao +2 more
exaly +3 more sources
Double Roman domination in trees
Information Processing Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huiqin Jiang +2 more
exaly +3 more sources
Independent Double Roman Domination in Graphs
Bulletin of the Iranian Mathematical Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamidreza Maimani +2 more
exaly +2 more sources
Majority double Roman domination in graphs
Discrete Mathematics, Algorithms and Applications, 2023A majority double Roman dominating function (MDRDF) on a graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] is adjacent to at least two vertices assigned with 2 or to at least one vertex [Formula: see text] with [Formula: see text], (ii) every vertex [Formula: see text ...
S. Anandha Prabhavathy, I. Sahul Hamid
openaire +2 more sources
Inverse double Roman domination in graphs
Discrete Mathematics, Algorithms and Applications, 2022For a graph [Formula: see text], a double Roman dominating function (DRDF) is a function [Formula: see text] such that each vertex [Formula: see text] with [Formula: see text] is adjacent to at least two vertices labeled [Formula: see text] or one vertex labeled [Formula: see text] and each vertex [Formula: see text] with [Formula: see text] is ...
Wilma Laveena D' Souza +2 more
openaire +1 more source
The Restrained Double Roman Domination in Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2022A double Roman dominating function on a graph \(G=(V(G), E(G))\) is a function \(f : V(G)\rightarrow \{0, 1, 2, 3\}\) satisfying the property that every vertex assigned 0 has at least two neighbors assigned 2 or one neighbor assigned 3, and every vertex assigned 1 has at least one neighbor assigned 2 or 3.
Changqing Xi, Jun Yue
openaire +1 more source
On algorithmic complexity of double Roman domination
Discrete Applied Mathematics, 2020A double Roman dominating function on a graph \(G=(V,E)\) is a function \(f:V\rightarrow \{0,1,2,3\}\) such that every vertex \(v \in V\) with \(f(v)=0\) is either adjacent to a vertex \(u\) with \(f(u)=3\) or two distinct vertices \(x\) and \(y\) with \(f(x)=f(y)=2\), and every vertex \(v \in V\) with \(f(v)=1\) is adjacent to a vertex \(u\) with \(f ...
Abolfazl Poureidi, Nader Jafari Rad
openaire +2 more sources
On the Global Double Roman Domination of Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guoliang Hao, Xiaodan Chen
openaire +2 more sources
Total double Roman domination numbers in digraphs
Discrete Mathematics, Algorithms and Applications, 2021Let [Formula: see text] be a finite and simple digraph with vertex set [Formula: see text]. A double Roman dominating function (DRDF) on digraph [Formula: see text] is a function [Formula: see text] such that every vertex with label 0 has an in-neighbor with label 3 or two in-neighbors with label 2 and every vertex with label 1 have at least one in ...
Jafar Amjadi, F. Pourhosseini
openaire +2 more sources
Double Roman Domination in Generalized Petersen Graphs
Bulletin of the Iranian Mathematical Society, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gao, Hong +2 more
openaire +1 more source