Outer-independent total Roman domination in graphs (Q2328098)

\textit{E. J. Cockayne} et al. [Discrete Math. 278, No. 1--3, 11--22 (2004; Zbl 1036.05034)] have introduced the concept of Roman domination in graphs. The authors start by establishing the relationship between outer independent Roman domination number and outer independent total Roman domination number. A major computational result in this paper namely ``the computation of outer independent total Roman domination is NP-complete even when restricted to planar graphs of maximum degree at most 3'' is very interesting. Even though the proof techniques are routine the way in which they are presented definitely deserve appreciation.