Results 191 to 200 of about 325 (215)

Quasi total double Roman domination in trees

2023
Summary: A quasi total double Roman dominating function (QTDRD-function) on a graph \(G=(V(G)\), \(E(G))\) is a function \(f:V(G)\longrightarrow \{0,1,2,3\}\) having the property that (i) if \(f(v)=0\), then vertex \(v\) must have at least two neighbors assigned 2 under \(f\) or one neighbor \(w\) with \(f(w)=3\); (ii) if \(f(v)=1\), then vertex \(v ...
Akhoundi, Maryam, Khan, Aysha, Shafi, Jana, Volkmann, Lutz   +3 more
openaire   +1 more source

Covering total double Roman domination in graphs

2021
Summary: For a graph \(G\) with no isolated vertex, a covering total double Roman dominating function (CTDRD function) \(f\) of \(G\) is a total double Roman dominating function (TDRD function) of \(G\) for which the set \(\{v \in V(G)\mid f(v)\neq 0\}\) is a vertex cover set. The covering total double Roman domination number \(\gamma_{\mathrm{ctdR}}(G)
Teymourzadeh, Atieh, Mojdeh, Doost Ali
openaire   +1 more source

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   +1 more source

Bounds on the quasi-total double Roman domination number in graphs

Discrete Mathematics, Algorithms and Applications
A quasi-total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if [Formula: see text], then vertex [Formula: see text] must have at least two neighbors assigned 2 under [Formula: see text] or one neighbor [Formula: see text] with [Formula: see text]; (ii) if [
J. Amjadi, S. Babaei, S. M. Sheikholeslami, M. Chellali, S. Kosari   +4 more
openaire   +1 more source

On computing total double Roman domination number of trees in linear time

2020
Let $G=(V,E)$ be a graph. A doubleRoman dominating function (DRDF) on $G$ is a function$f:Vto{0,1,2,3}$ such that for every vertex $vin V$if $f(v)=0$, then either there is a vertex $u$ adjacent to $v$ with $f(u)=3$ orthere are vertices $x$ and $y$ adjacent to $v$ with $f(x)=f(y)=2$ and if $f(v)=1$, then there is a vertex $u$ adjacent to $v$ with$f(u ...
openaire   +1 more source

Double Roman Domination: A Survey

Mathematics, 2023
Darja Rupnik Poklukar, Janez Žerovnik, Žerovnik Janez   +2 more
exaly  

Roman {3}-domination (double Italian domination)

Discrete Applied Mathematics, 2020
Doost Ali Mojdeh, Lutz Volkmann
exaly  

Complexity of Roman {2}-domination and the double Roman domination in graphs

AKCE International Journal of Graphs and Combinatorics, 2020
Padamutham Chakradhar, P Venkata Subba Reddy   +1 more
exaly  

Double Roman domination

Discrete Applied Mathematics, 2016
TERESA W Haynes, Stephen T Hedetniemi
exaly  

Outer independent double Roman domination

Applied Mathematics and Computation, 2020
Mustapha Chellali, S M Sheikholeslami
exaly