On the total and strong version for Roman dominating functions in graphs (Q2662879)

As indicated by the authors, many variations on the basic notion of domination in graphs have been introduced in the literature. In particular, one can speak of Roman domination and total domination. In the introduction, the authors say that they will study some combination of these two properties, further noting that the ``total Roman domination number'' was introduced by \textit{C.-H. Liu} and \textit{G. J. Chang} [J. Comb. Optim. 26, No. 3, 608--619 (2013; Zbl 1282.90217)], although in a more general setting. In fact, the authors add one more adjective to the parameter to be studied. Here, the authors are interested in the ``total strong Roman domination number'' of a graph. Bounds for general graphs on this new parameter are provided, as well exact results for basic families of graphs such as paths and cycles. The authors also compare the values of the total strong Roman domination number of a graph to other parameters like the domination number, total domination number and strong Roman domination number. Finally, the authors present two bounds for the total strong Roman domination number of trees.