Results 1 to 10 of about 8,869,670 (146)

Signed total double Roman dominating functions in graphs

AKCE International Journal of Graphs and Combinatorics
A signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi, H. Abdollahzadeh Ahangar, S. M. Sheikholeslami   +2 more
doaj   +5 more sources

Bounds on signed total double Roman domination [PDF]

Communications in Combinatorics and Optimization, 2020
A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least two neighbors assigned 2 under $f$ or one neighbor ...
L. Shahbazi, H. Abdollahzadeh Ahangar, R. Khoeilar, S.M. Sheikholeslami   +3 more
doaj   +2 more sources

On signed total double Roman domination number of graphs

Research in Mathematics
S.M. Sheikholeslami, M. Chellali, Yilun Shang, M. Esmaeili   +3 more
openaire   +1 more source

Double Roman Domination: A Survey

Mathematics, 2023
Since 2016, when the first paper of the double Roman domination appeared, the topic has received considerable attention in the literature. We survey known results on double Roman domination and some variations of the double Roman domination, and a list ...
Janez Žerovnik, Darja Rupnik Poklukar
exaly   +2 more sources

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:
L. Shahbazi, Hossein Abdollahzadeh Ahangar, R. Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
openaire   +2 more sources

On the signed Roman k-domination in graphs

Quaestiones Mathematicae, 2020
Let k ≥ 1 be an integer and G be a simple and finite graph with vertex set V (G). A signed Roman k-dominating function (SRkDF) on a graph G is a function f : V (G) → {−1, 1, 2} such that (i) every vertex v with f(v) = −1 is adjacent to at least one ...
Lutz Volkmann, J Amjadi
exaly   +1 more source

Outer independent signed double Roman domination

Journal of Applied Mathematics and Computing, 2021
Seyed Mahmoud Sheikholeslami, H Abdollahzadeh Ahangar   +1 more
exaly  

Lower Bounds on Signed Total Double Roman k-domination in Graphs

Journal of Mathematical Sciences and Informatics
Laila Shahbazi, Hossein Abdollahzadeh Ahangar, Rana Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
openaire   +1 more source

Signed double Roman domination in graphs

Discrete Applied Mathematics, 2019
Hossein Abdollahzadeh Ahangar, Seyed Mahmoud Sheikholeslami   +1 more
exaly  

On the signed Roman k-domination: Complexity and thin torus graphs

Discrete Applied Mathematics, 2017
Sandi Klavžar, Zehui Shao, Pu Wu
exaly