@article {
author = {Hao, Guoliang and Volkmann, Lutz and Mojdeh, Doost Ali},
title = {Total double Roman domination in graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {5},
number = {1},
pages = {27-39},
year = {2020},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2019.26484.1118},
abstract = {Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:Vrightarrow{0,1,2,3}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one vertex assigned $3$ under $f$, whereas if $f(v)=1$, then the vertex $v$ must be adjacent to at least one vertex assigned $2$ or $3$. The weight of a DRDF $f$ is the sum $sum_{vin V}f(v)$. A total double Roman dominating function (TDRDF) on a graph $G$ with no isolated vertex is a DRDF $f$ on $G$ with the additional property that the subgraph of $G$ induced by the set ${vin V:f(v)ne0}$ has no isolated vertices. The total double Roman domination number $gamma_{tdR}(G)$ is the minimum weight of a TDRDF on $G$. In this paper, we give several relations between the total double Roman domination number of a graph and other domination parameters and we determine the total double Roman domination number of some classes of graphs.},
keywords = {total double Roman domination,double Roman domination,total Roman domination,total domination,domination},
url = {http://comb-opt.azaruniv.ac.ir/article_13945.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_13945_dce686282b94fcb96a05edec316a45ef.pdf}
}