Results 221 to 230 of about 72,600 (248)
Some of the next articles are maybe not open access.
DOUBLE ROMAN DOMINATION NUMBER OF MIDDLE GRAPH
South East Asian J. of Mathematics and Mathematical Sciences, 2022For 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. +2 more
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 ...
Amjadi, J., Pourhosseini, F.
openaire +2 more sources
Double Roman domination subdivision number in graphs
Asian-European Journal of Mathematics, 2021For a graph [Formula: see text], a double Roman dominating function is a function [Formula: see text] having the property that if [Formula: see text], then vertex [Formula: see text] must have at least two neighbors assigned [Formula: see text] under [Formula: see text] or one neighbor with [Formula: see text], and if [Formula: see text], then vertex [
Amjadi, J., Sadeghi, H.
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
Twin signed double Roman domination numbers in directed graphs
Discrete Mathematics, Algorithms and Applications, 2022Let [Formula: see text] be a finite simple directed graph (shortly digraph). A function [Formula: see text] is called a twin signed double Roman dominating function (TSDRDF) if (i) every vertex [Formula: see text] with [Formula: see text] has at least two in-neighbor assigned a 2 or at least an in-neighbor [Formula: see text] with [Formula: see text],
Akram Mahmoodi +2 more
openaire +2 more sources
Roman Domination and Double Roman Domination Numbers of Sierpiński Graphs $$S(K_n,t)$$
Bulletin of the Malaysian Mathematical Sciences Society, 2021Sierpiński graph \(S_n^t\) can be defined recursively as \(S_n^1\cong K_n\) and one obtains \(S_n^{t+1}\) from \(S_n^t\) by replacing each vertex from \(S_n^t\) by a copy of \(K_n\) and adding some special edges between these copies of \(K_n\). Let \(G\) be a graph.
openaire +2 more sources
An Upper Bound on the Double Roman Domination Number
Bulletin of the Iranian Mathematical Society, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ouldrabah, Lyes, Volkmann, Lutz
openaire +1 more source
New bounds on the outer-independent total double Roman domination number
Discrete Mathematics, Algorithms and Applications, 2023A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying (i) if [Formula: see text] then there must be at least two neighbors assigned two under [Formula: see text] or one neighbor [Formula: see text] with [Formula: see text]; and (ii) if [Formula: see text] then [Formula: see text] must be ...
S. M. Sheikholeslami, L. Volkmann
openaire +2 more sources
Extremal Digraphs for an Upper Bound on the Double Roman Domination Number
Bulletin of the Malaysian Mathematical Sciences Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ouldrabah, Lyes +3 more
openaire +1 more source
A note on the double Roman domination number of graphs
Czechoslovak Mathematical Journal, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources