Results 221 to 227 of about 405 (227)
Signed double Roman \(k\)-domination in graphs [PDF]
Summary: Let \(G=(V,E)\) be a simple and finite graph with vertex set \(V(G)\), and let \(k\geq 1\) be an integer. A signed double Roman \(k\)-dominating function (SDR\(k\)DF) on a graph \(G\) is a function \(f:V(G)\rightarrow \{-1,1,2,3\}\) such that (i) every vertex \(v\) with \(f(v)=-1\) is adjacent to at least two vertices assigned with 2 or to at ...
Jafar Amjadi +4 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Roman {3}-domination (double Italian domination)
Discrete Applied Mathematics, 2020Doost Ali Mojdeh, Lutz Volkmann
exaly
Outer independent double Roman domination
Applied Mathematics and Computation, 2020Mustapha Chellali +2 more
exaly
On weak double Roman domination in graphs
Discrete Applied MathematicsS. Soltani +4 more
openaire +1 more source
Global double Roman domination in graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2019Shaohui Wang +2 more
exaly
Meta-heuristic Algorithms for Double Roman Domination Problem
Applied Soft Computing JournalP Venkata Subba Reddy
exaly

