Further Results on the Total Roman Domination in Graphs

: 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 γ tR ( G ) , is the minimum weight ω ( f ) = ∑ v ∈ V ( G ) f ( v ) among all total Roman dominating functions f on G . In this article we obtain new tight lower and upper bounds for γ tR ( G ) which improve the well-known bounds 2 γ ( G ) ≤ γ tR ( G ) ≤ 3 γ ( 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.


Introduction
Domination theory is a classical and interesting topic in theory of graphs, as well as one of the most active areas of research in this topic. The increasing interest in this area is partly explained by the diversity of applications to both theoretical and real-world problems, such as facility location problems, monitoring communication, coding theory, algorithm design, complex ecosystems, electrical networks, among others. A set D ⊆ V(G) of vertices of a graph G is a dominating set if every vertex in V(G) \ D is adjacent to at least one vertex in D. The domination number of G, denoted by γ(G), is the minimum cardinality among all dominating sets of G. Many variants of the previous concept have appeared in the literature. We refer to [1,2] for numerous results on this issue.
A remarkable variant of the parameter above, and one of the most studied, is as follows. A dominating set D of a graph G without isolated vertices is a total dominating set if the subgraph induced by the vertices of D has no isolated vertex. Notice that any graph with no isolated vertex has a total dominating set, since D = V(G) is such a set. The total domination number of G, denoted by γ t (G), is the minimum cardinality among all total dominating sets of G. More information on total domination in graphs can be found in the survey [3] and the book [4].
Next, we consider another variant of the concept of domination. A semitotal dominating set of a graph G without isolated vertices, is a dominating set D of G such that every vertex in D is within distance two of another vertex of D. The semitotal domination number, denoted by γ t2 (G), is the minimum cardinality among all semitotal dominating sets of G. This parameter was introduced by Goddard et al. in [5], and was also further studied in [6][7][8].
For any graph without isolated vertices, we have that every semitotal dominating set is also a dominating set. Similarly, every total dominating set is a semitotal dominating set. Hence, the next inequality chain, given in [5], relates the parameters above.
In the last decades, functions defined on graphs have received much attention in domination theory. This fact may be because the classical (total) domination problem can be studied using functions defined on graphs. Based on this approach, we consider the following concepts, which are also variants of the domination in graphs.
Let f : V(G) → {0, 1, 2} be a function on a graph G. Notice that f generates three sets V 0 , V 1 and In this sense, from now on, we will write In this sense, by an f (V(G))-function, we mean a function of weight f (V(G)). If the function f is clear from the context, then we will simply write f (V 0 , V 1 , V 2 ). We shall also use the following notations: Roman domination in graphs was formally defined by Cockayne, Dreyer, Hedetniemi, and Hedetniemi [9] motivated, in part, by an article in Scientific American of Ian Stewart entitled "Defend the Roman Empire" [10]. A Roman dominating function (RDF) on a graph G is a function f (V 0 , V 1 , V 2 ) satisfying that every vertex u ∈ V 0 is adjacent to at least one vertex v ∈ V 2 . The Roman domination number of G, denoted by γ R (G), is the minimum weight among all RDFs on G. Further results on Roman domination can be found for example, in [11][12][13][14].
Another kind of functions defined on graphs are the total Roman dominating functions, which were introduced by Liu and Chang [15] and later, studied by Abdollahzadeh Ahangar et al. in [16]. A total Roman dominating function (TRDF) on a graph G without isolated vertices, is an RDF f (V 0 , V 1 , V 2 ) such that the set V 1 ∪ V 2 is a total dominating set of G. The minimum weight among all TRDFs on G is the total Roman domination number of G and it is denoted by γ tR (G).
Abdollahzadeh Ahangar et al. [16] give the next relationship between the total Roman domination number and the domination number of a graph: If G is a graph with no isolated vertex, then Also, the authors of [16] proposed open problems concerning characterizing the graphs that satisfy the equalities in the inequality chain above. While the families of trees which satisfy these equalities has been characterized in [17], it remains an open problem to characterize graphs in general. In that sense, in this article we study the open problems above. In the next section we first give new lower and upper bounds for this parameter, which improve the bounds given in the Inequality chain (2). Also, in Section 3 we give a characterization for the graphs G that satisfy the equality γ tR (G) = 2γ(G); and finally, in Section 4 we give some necessary conditions that satisfy the graphs G for which γ tR (G) = 3γ(G).

Notation
Throughout this article we consider G = (V(G), E(G)) as a simple graph of order n = |V(G)|. to D. Also, and as is commonly defined, G − D denotes the graph obtained from G such that . For any two vertices u and v, the distance d(u, v) between u and v is the length of a shortest u − v path.
A set X of vertices of G is a packing in G if the closed neighbourhoods of vertices in A leaf vertex of a graph G is a vertex of degree one, and a support vertex of G is a vertex adjacent to a leaf. The set of leaves and support vertices are denoted by L(G) and S(G), respectively. Also, given a set D ⊆ V(G) we denote I(D) as an independent set of maximum cardinality in G[D] such that |I(D) ∩ S(G)| is maximum.
Other definitions will be introduced as needed.

Main Result
We begin this section with the following useful result of total Roman dominating functions given in [16].
It is known from [9] that for any graph G, γ R (G) ≤ 2γ(G) and also, from Inequality chain (1) that γ(G) ≤ γ t2 (G). Hence, and as consequence of both inequalities above, we deduce that the following result improves the lower and upper bounds given in Inequality chain (2) for the total Roman domination number of graphs. Theorem 1. For any graph G with neither isolated vertex nor components isomorphic to K 2 , Proof. We first prove the lower bound. By Lemma 1, there exists a γ tR (G)- is a dominating set of G − V g 1,1 and can be extended to a dominating set of G by adding to it the set which completes the proof of the lower bound. Now, in order to prove the upper bound, let D be a γ(G)-set and f (V 0 , Since f is an RDF on G, by construction we have that f is a TRDF on G. Therefore, which completes the proof. Now, we show a family of graphs G p,q given by Cabrera et al. in [18], which satisfy that Let p, q be two integers such that q ≥ p ≥ 2. From the complete bipartite graph K p,q and the empty graph N p , we construct the graph G p,q as follows. We add p new edges which form a matching between the vertices of N p and the vertices of degree q in K p,q . Figure 1 shows the graph G 3,4 and a γ tR (G 3,4 )-function g(V 0 , V 1 , V 2 ). Next, we provide some useful properties that satisfies a specific TRDF for the graphs G with γ tR (G) = γ t2 (G) + γ(G).
We consider again the family of graphs G p,q . Let g(V 0 , V 1 , V 2 ) be a γ tR (G p,q )-function defined as V 2 = {v} and V 1 = (S(G p,q ) ∪ L(G p,q )) \ {v}, for some v ∈ S(G). Notice that g satisfies the conditions given in Theorem 2. For an example, see the γ tR (G 3,4 )-function g showed in the Figure 1.
Next, we will show a family of graphs G r that satisfy the upper bound in the Theorem 1. In this case we have that γ(G r ) = r, γ R (G r ) = 2r and γ tR (G r ) = 3r, where r ≥ 2 is an integer. The graph G r is constructed from the path graph P 3r−2 = v 1 v 2 · · · v 3r−2 and the empty graph N 2 by taking one copy of P 3r−2 and r copies of N 2 and adding edges between the vertex v 3i−2 and the i-th copy of N 2 , for i ∈ {1, . . . , r}. Figure 2 shows the graph G 3 .

Graphs G with γ tR (G) = 2γ(G)
We begin this section with a simple characterization, which is a direct consequence of Theorem 1 and the Inequality chains (1) and (2). We observe that the condition γ tR (G) = γ t2 (G) + γ(G) is a necessary condition but is not sufficient to satisfy the equality γ tR (G) = 2γ(G). For instance, see the graph G 3,4 shown in Figure 1.
Next, we give another characterization for the graphs G satisfying γ tR (G) = 2γ(G). It is important to emphasize that this characterization depends only of the existence of a γ(G)-set which satisfies some specific conditions. Proof. First, we suppose that γ tR (G) = 2γ(G). By Lemma 1, there exists a γ tR (G)-function By proceeding analogously as the proof of the lower bound of Theorem 1 and since γ tR Let D be the set formed by taking one vertex from each Thus, by construction of sets S and D, it is easy to see that Statements (a) and (b) hold.
Conversely, we suppose there exist a γ(G)-set S and a set D ⊆ S such that Statements (a), (b) and (c) hold. Let A D be a γ t (G − D * )-set. By Statements (a) and (b) we have that S \ D is a dominating set of G − D * and so, by using Statement (c), we deduce that |A D | = γ(G − D * ) ≤ |S \ D|. Moreover, we observe that the function f (V 0 , V 1 , V 2 ), defined by V 1 = D * and V 2 = A D , is a TRDF on G. Therefore, by Inequality chain (2) and statements above, we obtain 2γ(G) ≤ γ tR (G) ≤ ω( f ) = |D * | + 2|A D | ≤ 2|D| + 2|S \ D| = 2|S| = 2γ(G). Thus, we have equalities in the previous inequality chain. In particular, γ tR (G) = 2γ(G), which completes the proof.

Some Necessary Conditions for the Graphs G satisfying γ tR (G) = 3γ(G)
Analogously to the section above, we continue now with a simple characterization, which is a direct consequence of Theorem 1 and the well-know inequality γ R (G) ≤ 2γ(G).
We want to accentuate that in all the examples in which we have observed that the upper bound of Theorem 1 is achieved, we also have that γ R (G) = 2γ(G). In such a sense, we propose the following conjecture, which we could not prove.
In order to give some necessary conditions for the graphs G satisfying γ tR (G) = 3γ(G), we shall need the following definition and useful results.

Definition 1.
A graph G satisfies Property P if for every γ(G)-set S, there exist no three vertices x, y, z ∈ S such that
Notice that the families of graphs G p,q and G r given in Section 2 satisfy the Property P. Moreover, the Figure 3 shows a graph G that does not satisfy Property P. Observe that the set S = {x, y, z} is a γ(G)-set and also, it is easy to see that |epn(x, S)| = |epn(z, S)| = 2 and that the vertex y ∈ epn(y, S) satisfies the condition d(x, y ) = d(y , z) = 2. z x y y Figure 3. A graph G that does not satisfy the Property P.

Lemma 2.
Let G be a graph and let S be a γ(G)-set. If S is a packing, then for all v ∈ S there exists v ∈ S such that d(v, v ) = 3.

Proof.
Suppose there exists a vertex v ∈ S such that for all vertex v ∈ S \ {v}, it is satisfied that d(v, v ) > 3 (notice that d(v, v ) ≥ 3 because S is a packing). Hence, every vertex at distance two of v is not dominated by S, which is a contradiction. This completes the proof.

Proposition 1.
If G is a graph such that every γ(G)-set is a packing, then for every γ(G)-set S and for every v ∈ S it is satisfied that |epn(v, S)| ≥ 2.
Proof. Let S be a γ(G)-set and let v ∈ S. Since S is a packing, we have that epn(v, S) = ∅. If epn(v, S) = {u}, then v is a vertex of degree one. By using Lemma 2, we have that S = (S \ {v}) ∪ {u} is a γ(G)-set, but is not a packing, contradicting the hypothesis. So |epn(v, S)| ≥ 2, as desired.
Theorem 6. Let G be a graph. If γ tR (G) = 3γ(G), then the following statements hold.
(ii) S is a packing, for every γ(G)-set S.
(iii) G satisfies Property P.
Proof. By Theorem 5, Statement (i) follows. Moreover, Abdollahzadeh Ahangar et al. showed in [16] that every γ(G)-set is a packing, which implies that Statement (ii) holds. Next we prove Statement (iii). In that sense, we suppose that G does not satisfy Property P. Hence there exist a γ(G)-set S and three vertices x, y, z ∈ S satisfying the conditions given in Definition 1. By Statement (ii) and Proposition 1 we have |epn(v, S)| ≥ 2, for every v ∈ S. Let x ∈ epn(x, S) \ N(y ) and z ∈ epn(z, S) \ N(y ). Now, we consider the function f defined as follows. Notice that, by construction, f is a TRDF on G. Therefore, which is a contradiction. Hence G satisfies Property P and the proof is complete.

Conclusions and Open Problems
New results concerning the study of total Roman domination in graphs have been presented in this article. Among the main contributions, the following should be highlighted.

•
As the main result, we have provided new lower and upper bounds for the total Roman domination number of graphs, which improve other well-known bounds.

•
We have shown a theoretical characterization for the graphs G satisfying γ tR (G) = 2γ(G).

•
We have shown some necessary conditions for the graphs G that satisfy γ tR (G) = 3γ(G).
On the other hand, and as a consequence of this study, some open problems have arisen. Next, we expose some of the most interesting.

Conflicts of Interest:
The authors declare no conflict of interest.