Results 141 to 150 of about 98,924 (189)
Some of the next articles are maybe not open access.
Double Roman domination in trees
Information Processing Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiujun Zhang, Zepeng Li, Huiqin Jiang
exaly +4 more sources
On the double Roman domination of graphs
Applied Mathematics and Computation, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Yue, Meiqin Wei
exaly +3 more sources
Double Roman domination number
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aparna Lakshmanan S
exaly +3 more sources
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
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 ...
Mustapha Chellali, S M Sheikholeslami
exaly +2 more sources
Bulletin of the Malaysian Mathematical Sciences Society
The authors introduce a new variant of domination in graphs called weak double Roman domination (WDRD), which generalizes the well-studied concept of double Roman domination (DRD) by relaxing certain constraints. Given a graph \( G = (V, E) \), a WDRD-function is a labeling \( f: V \to \{0,1,2,3\} \) that satisfies the following condition: every vertex
Soltani, S. +4 more
openaire +2 more sources
The authors introduce a new variant of domination in graphs called weak double Roman domination (WDRD), which generalizes the well-studied concept of double Roman domination (DRD) by relaxing certain constraints. Given a graph \( G = (V, E) \), a WDRD-function is a labeling \( f: V \to \{0,1,2,3\} \) that satisfies the following condition: every vertex
Soltani, S. +4 more
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 +2 more sources
Double Roman Domination in Cartesian Product
Creative Mathematics and InformaticsGiven a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2,3\}$ having the property that if $f(v)=0$, then there exist $ v_{1},v_{2}\in N(v)$ such that $f(v_{1})=2=f(v_{2})$ or there exists $ w \in N(v)$ such that $f(w)=3$, and if $f(v)=1$, then there exists $ w \in N(v)$ such that $f(w)\geq 2$ is called a double Roman dominating function (DRDF). The
Anu, V., Aparna, Lakshmanan S.
openaire +2 more sources
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 +2 more sources