Results 261 to 270 of about 85,053 (298)
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
openaire +2 more sources
Double Roman domination number
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anu V., Aparna Lakshmanan S.
openaire +2 more sources
Double Roman domination in trees
Information Processing Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiujun Zhang +3 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
Outer independent signed double Roman domination
Journal of Applied Mathematics and Computing, 2021Suppose $$[3]=\{0,1,2,3\}$$ and $$[3^{-}]=\{-1,1,2,3\}$$ . An outer independent signed double Roman dominating function (OISDRDF) of a graph
Ahangar, H. Abdollahzadeh +3 more
openaire +1 more source
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 +1 more source
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 +1 more source
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
Global double Roman domination in graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2019A double Roman dominating function (DRDF) on a graph G = (V, E) is a function f : V(G) → {0, 1, 2, 3} having the property that if f(v) = 0, then vertex v must have at least two neighbors assigned 2...
Zehui Shao +3 more
openaire +1 more source
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
Signed total double Roman k-domination in graphs
Discrete Mathematics, Algorithms and Applications, 2019A signed total double Roman [Formula: see text]-dominating function (STDRkDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] has at least two neighbors assigned 2 under [Formula: see text] or at least one neighbor [Formula: see text] with [Formula:
Shahbazi, L. +3 more
openaire +1 more source