@article {
author = {amjadi, Jafar},
title = {Total Roman domination subdivision number in graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {5},
number = {2},
pages = {157-168},
year = {2020},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2020.26470.1117},
abstract = {A Roman dominating function on a graph $G$ is a function $f:V(G)\rightarrow \{0,1,2\}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A total Roman dominating function is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has no isolated vertices. The weight of a total Roman dominating function $f$ is the value $\Sigma_{u\in V(G)}f(u)$. The total Roman domination number of $G$, $\gamma_{tR}(G)$, is the minimum weight of a total Roman dominating function on $G$. The total Roman domination subdivision number ${\rm sd}_{\gamma_{tR}}(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (each edge in $G$ can be subdivided at most once) in order to increase the total Roman domination number. In this paper, we initiate the study of total Roman domination subdivision number in graphs and we present sharp bounds for this parameter. },
keywords = {total Roman domination,total Roman domination subdivision,graph},
url = {http://comb-opt.azaruniv.ac.ir/article_13997.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_13997_361f34d42a9e4c4eeb3798140a18ae6f.pdf}
}