Results 1 to 10 of about 40 (32)

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   +4 more sources

More results on the signed double Roman domination number of graphs

AKCE International Journal of Graphs and Combinatorics
A signed double Roman dominating function (SDRD-function) on a graph G is defined as a function [Formula: see text] having the property that [Formula: see text] for each [Formula: see text] and if [Formula: see text], then the vertex u must have a ...
Seyed Mahmoud Sheikholeslami, Lutz Volkmann   +1 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

Signed double Roman domination in graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Abdollahzadeh Ahangar, Seyed Mahmoud Sheikholeslami   +1 more
exaly   +5 more sources

More results on the signed double Roman k-domination in graphs

Aequationes Mathematicae
Abstract Let $$k\ge 1$$ k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V(G).
Michael Henning, Lutz Volkmann
exaly   +3 more sources

Signed double Roman domination on cubic graphs

Applied Mathematics and Computation
The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized. Here feasibility is given whenever (i) vertices labeled $\pm{}1$ have at least one neighbor with label in $\{2,3\}$; (ii) each ...
Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl   +3 more
openaire   +5 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

Lower bounds for signed double Roman k -domination in unicyclic graphs

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

Outer independent signed double Roman domination

Journal 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
Seyed Mahmoud Sheikholeslami, H Abdollahzadeh Ahangar   +1 more
exaly   +2 more sources

Signed double Roman domination numbers in digraphs

Annals of the University of Craiova - Mathematics and Computer Science Series, 2021
"Let $D=(V,A)$ be a finite simple digraph. A signed double Roman dominating function (SDRD-function) on the digraph $D$ is a function $f:V(D)\rightarrow\{-1,1,2, 3\}$ satisfying the following conditions: (i) $\sum_{x\in N^-[v]}f(x)\ge 1$ for each $v\in V(D)$, where $N^-[v]$ consist of $v$ and all in-neighbors of $v$, and (ii) if $f(v)=-1$, then the ...
Jafar Amjadi, Fatemeh Pourhosseini
openaire   +1 more source