Results 121 to 130 of about 169 (151)
Outer independent signed double Roman domination
Suppose $$[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 +2 more sources
Twin signed double Roman domination numbers in directed graphs
Let [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 +3 more sources
Signed total double Roman k-domination in graphs
A 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 +2 more sources
Independent Signed Double Roman Domination
柠 李
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Understanding the Electric Double-Layer Structure, Capacitance, and Charging Dynamics
Chemical Reviews, 2022Jianzhong Wu
exaly

