*Article* **Further Results on the Total Roman Domination in Graphs**

### **Abel Cabrera Martínez 1,\*, Suitberto Cabrera García 2 and Andrés Carrión García 2**


Received: 17 February 2020; Accepted: 2 March 2020; Published: 5 March 2020

**Abstract:** Let *G* be a graph without isolated vertices. A function *f* : *V*(*G*) → {0, 1, 2} is a total Roman dominating function on *G* if every vertex *v* ∈ *V*(*G*) for which *f*(*v*) = 0 is adjacent to at least one vertex *u* ∈ *V*(*G*) such that *f*(*u*) = 2, and if the subgraph induced by the set {*v* ∈ *V*(*G*) : *f*(*v*) ≥ 1} has no isolated vertices. The total Roman domination number of *G*, denoted *<sup>γ</sup>tR*(*G*), is the minimum weight *ω*(*f*) = ∑*v*∈*<sup>V</sup>*(*G*) *f*(*v*) among all total Roman dominating functions *f* on *G*. In this article we obtain new tight lower and upper bounds for *<sup>γ</sup>tR*(*G*) which improve the well-known bounds <sup>2</sup>*γ*(*G*) ≤ *<sup>γ</sup>tR*(*G*) ≤ <sup>3</sup>*γ*(*G*), where *γ*(*G*) represents the classical domination number. In addition, we characterize the graphs that achieve equality in the previous lower bound and we give necessary conditions for the graphs which satisfy the equality in the upper bound above.

**Keywords:** total Roman domination; Roman domination; semitotal domination; domination
