Results 171 to 180 of about 64,106 (202)

Outer independent signed double Roman domination

open access: closedJournal of Applied Mathematics and Computing, 2021
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

New bounds on the outer-independent total double Roman domination number

open access: closedDiscrete Mathematics, Algorithms and Applications, 2023
A 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   +3 more sources

Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs

open access: closedInternational Journal of Foundations of Computer Science
Let [Formula: see text] be graph. For any function [Formula: see text], let [Formula: see text], [Formula: see text]. The function [Formula: see text] is called an outer-independent double Roman dominating function (OIDRDF) if the following conditions are satisfied.
Amit Sharma   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy