Results 251 to 260 of about 85,878 (263)

Signed total double Roman k-domination in graphs

Discrete Mathematics, Algorithms and Applications, 2019
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., Abdollahzadeh Ahangar, H., Khoeilar, R., Sheikholeslami, S. M.   +3 more
openaire   +1 more source

Double Roman domination in some graphs

Discrete Mathematics, Algorithms and Applications
A double Roman dominating function on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions that if [Formula: see text], then every vertex v is adjacent to minimum one vertex u for which [Formula: see text] or two vertices [Formula: see text] and [Formula: see text] for which [Formula: see text] and if [Formula: see ...
J. Meena, T. N. M. Malini Mai, M. L. Suresh, Laxmi Rathour, Lakshmi Narayan Mishra   +4 more
openaire   +1 more source

On the complexity of perfect Roman domination and perfect double Roman domination

Discrete Mathematics, Algorithms and Applications
For a graph [Formula: see text] and a function [Formula: see text], let [Formula: see text] ([Formula: see text]) be the set of vertices assigned the value [Formula: see text] by [Formula: see text]. A perfect Roman dominating function on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula:
Seyed Hosein Mirhoseini, Nader Jafari Rad, Noor A’lawiah Abd Aziz, Hailiza Kamarulhaili   +3 more
openaire   +1 more source

Outer Independent Double Roman Domination Stability in Graphs

Ars Combinatoria
An outer independent double Roman dominating function (OIDRDF) on a graph G is a function f : V ( G ) → { 0 , 1 , 2 , 3 } having the property that (i) if f ( v ) = 0 , then the vertex v must have at least two neighbors assigned 2 under f or one neighbor w with f ( w ) = 3 , and if f ( v ) = 1 , then the vertex v must have at least one ...
Sheikholeslami, S. M., Esmaeili, M., Volkmann, L.   +2 more
openaire   +2 more sources

Double Roman domination stability in graphs

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On double roman domination edge critical graphs

Discrete Mathematics, Algorithms and Applications
A double Roman dominating function (or just DRDF) on a graph [Formula: see text] is a function [Formula: see text] having the property that if [Formula: see text] for a vertex [Formula: see text], then [Formula: see text] has at least two neighbors assigned [Formula: see text] or one neighbor assigned [Formula: see text] under [Formula: see text], and
Farshad Sajedi, Nader Jafari Rad
openaire   +1 more source

Outer independent double Roman domination

Applied Mathematics and Computation, 2020
Seyed Mahmoud Sheikholeslami
exaly  

Independent Signed Double Roman Domination

Advances in Applied Mathematics
openaire   +1 more source

Mixed double Roman domination in graphs

Abdollahzadeh Ahangar, H., Chellali, M., Sheikholeslami, S.M., Valenzuela Tripodoro, J.C.   +3 more
openaire   +1 more source

Algorithmic results on double Roman domination in graphs

Journal of Combinatorial Optimization, 2019
Michael A Henning
exaly