Results 221 to 230 of about 72,011 (256)
An upper bound on the double Roman domination number
Journal of Combinatorial Optimization, 2018 From the summary: ``A double Roman dominating function (DRDF) on a graph \(G=(V, E)\) is a function \(f: V\to \{0,1, 2, 3\}\) having the property that if \(f(v)=0\), then 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 vertex \(v\) must have at least one neighbor ...
J. Amjadi +3 more
openaire +3 more sources
Extremal Digraphs for an Upper Bound on the Double Roman Domination Number
Bulletin of the Malaysian Mathematical Sciences Society, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ouldrabah, Lyes +3 more
openaire +2 more sources
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khoeilar, Rana +3 more
openaire +3 more sources
A note on the double Roman domination number of graphs
Czechoslovak Mathematical Journal, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xue-gang Chen
openaire +3 more sources
Disprove of a conjecture on the double Roman domination number
Aequationes mathematicaeThe paper addresses a conjecture regarding the double Roman domination number \(\gamma_{dR}(G)\) in graph theory, a topic introduced by \textit{R. A. Beeler} et al. [Discrete Appl. Math. 211, 23--29 (2016; Zbl 1348.05146)]. The double Roman dominating function (DRDF) \(f: V \to \{0, 1, 2, 3\}\) on a graph \(G = (V, E)\) requires specific conditions on ...
Z. Shao +4 more
openaire +3 more sources
Independent double roman domination number of a tree in terms of its 2-independence number
Discrete Mathematics, Algorithms and ApplicationsLet [Formula: see text] be a simple graph. An independent double Roman dominating function (IDRDF) on a graph [Formula: see text] is a function [Formula: see text] having the property that first if [Formula: see text], then vertex [Formula: see text] has at least two neighbors assigned [Formula: see text] under [Formula: see text] or one neighbor ...
Halimeh Koulivand +3 more
openaire +2 more sources
On computing total double Roman domination number of trees in linear time
, 2020 Let $G=(V,E)$ be a graph. A doubleRoman dominating function (DRDF) on $G$ is a function$f:Vto{0,1,2,3}$ such that for every vertex $vin V$if $f(v)=0$, then either there is a vertex $u$ adjacent to $v$ with $f(u)=3$ orthere are vertices $x$ and $y$ adjacent to $v$ with $f(x)=f(y)=2$ and if $f(v)=1$, then there is a vertex $u$ adjacent to $v$ with$f(u ...
Abolfazl Poureidi
openaire +2 more sources
Research on the Double Roman Domination Number of Some Special Graphs
Advances in Applied Mathematics, 2022 沙沙 刘
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 ...
Amjadi, J., Pourhosseini, F.
openaire +2 more sources
Signed double Roman domination numbers in digraphs
Annals of the University of Craiova - Mathematics and Computer Science Series, 2021"Let $D=(V,A)$ be a finite simple digraph. A signed double Roman dominating function (SDRD-function) on the digraph $D$ is a function $f:V(D)\rightarrow\{-1,1,2, 3\}$ satisfying the following conditions: (i) $\sum_{x\in N^-[v]}f(x)\ge 1$ for each $v\in V(D)$, where $N^-[v]$ consist of $v$ and all in-neighbors of $v$, and (ii) if $f(v)=-1$, then the ...
Jafar Amjadi, Fatemeh Pourhosseini
openaire +1 more source