Results 211 to 220 of about 426 (246)

Double Roman domination number [PDF]

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aparna Lakshmanan S
exaly   +4 more sources

An Upper Bound on the Double Roman Domination Number [PDF]

Bulletin of the Iranian Mathematical Society, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ouldrabah, Lyes, Volkmann, Lutz
openaire   +2 more sources

An upper bound on the double Roman domination number [PDF]

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 ...
Jafar Amjadi, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +3 more
openaire   +3 more sources

Trees with Double Roman Domination Number Twice the Domination Number Plus Two [PDF]

Iranian Journal of Science and Technology, Transactions A: Science, 2018
A double Roman dominating function (DRDF) on a graph $$G=(V,E)$$ is a function $$f:V(G)\rightarrow \{0,1,2,3\}$$
H. Abdollahzadeh Ahangar, J. Amjadi, M. Chellali, S. Nazari-Moghaddam, S. M. Sheikholeslami   +4 more
openaire   +2 more sources

Extremal Digraphs for an Upper Bound on the Double Roman Domination Number [PDF]

Bulletin of the Malaysian Mathematical Sciences Society, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ouldrabah, Lyes, Blidia, Mostafa, Bouchou, Ahmed, Volkmann, Lutz   +3 more
openaire   +2 more sources

Double Roman domination [PDF]

Discrete Applied Mathematics, 2016
For a graph G=(V,E), a double Roman dominating function is a function f:V→{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 with f(w)=3, and if f(v)=1, then vertex v must have ...
TERESA Haynes, Stephen T Hedetniemi
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Total double Roman domination numbers in digraphs

Discrete Mathematics, Algorithms and Applications, 2021
Let [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 NUMBER OF MIDDLE GRAPH

South East Asian J. of Mathematics and Mathematical Sciences, 2022
For any graph G(V,  E), a function f : V (G)    0, 1, 2, 3     is called Double Roman dominating function (DRDF) if the following properties holds, If f (v) = 0, then there exist two vertices v1, v2 ∈ N (v) for which f (v1) = f (v2) = 2 or there exist one vertex u ∈ N (v) for which f (u) = 3.∈ If f (v) = 1, then there exist one vertex u N (v) for which
Shirkol, Shailaja S., Kumbargoudra, Pavitra P., Kaliwal, Meenal M.   +2 more
openaire   +2 more sources

Perfect double Roman domination of trees [PDF]

Discrete Applied Mathematics, 2020
For a graph G with vertex set V(G) and function f:V(G)→{0,1,2,3}, let Vi be the set of vertices assigned i by f. A perfect double Roman dominating function of a graph G is a function f:V(G)→{0,1,2,3} satisfying the conditions that (i) if u∈V0, then u is ...
TERESA Haynes
exaly   +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