Results 221 to 227 of about 405 (227)

Signed double Roman \(k\)-domination in graphs [PDF]

open access: possibleAustralas. J Comb., 2018
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

A note on the double Roman domination number of graphs

Czechoslovak Mathematical Journal, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Roman {3}-domination (double Italian domination)

Discrete Applied Mathematics, 2020
Doost Ali Mojdeh, Lutz Volkmann
exaly  

Outer independent double Roman domination

Applied Mathematics and Computation, 2020
Mustapha Chellali   +2 more
exaly  

On weak double Roman domination in graphs

Discrete Applied Mathematics
S. Soltani   +4 more
openaire   +1 more source

Global double Roman domination in graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2019
Shaohui Wang   +2 more
exaly  

Meta-heuristic Algorithms for Double Roman Domination Problem

Applied Soft Computing Journal
P Venkata Subba Reddy
exaly  

Home - About - Disclaimer - Privacy