From Total Roman Domination in Lexicographic Product Graphs to Strongly Total Roman Domination in Graphs

Let G be a graph with no isolated vertex and let N(v) be the open neighbourhood of v∈V(G). Let f:V(G)→{0,1,2} be a function and Vi={v∈V(G):f(v)=i} for every i∈{0,1,2}. We say that f is a strongly total Roman dominating function on G if the subgraph induced by V1∪V2 has no isolated vertex and N(v)∩V2≠∅ for every v∈V(G)\V2. The strongly total Roman domination number of G, denoted by γtRs(G), is defined as the minimum weight ω(f)=∑x∈V(G)f(x) among all strongly total Roman dominating functions f on G. This paper is devoted to the study of the strongly total Roman domination number of a graph and it is a contribution to the Special Issue “Theoretical Computer Science and Discrete Mathematics” of Symmetry. In particular, we show that the theory of strongly total Roman domination is an appropriate framework for investigating the total Roman domination number of lexicographic product graphs. We also obtain tight bounds on this parameter and provide closed formulas for some product graphs. Finally and as a consequence of the study, we prove that the problem of computing γtRs(G) is NP-hard.


Introduction
Let G be a simple graph with no isolated vertex. Given a vertex v ∈ V(G), N(v) and N[v] denote the open neighbourhood and the closed neighbourhood of v in G, respectively. The order, minimum degree and maximum degree of G will be denoted by n(G), δ(G) and ∆(G), respectively. As usual, given a set D ⊆ V(G) and a vertex v ∈ D, the external private neighbourhood and the internal private neighbourhood of v with respect to D is defined to be epn Domination in graphs is a classical research topic that has experienced rapid growth since its introduction. A set D ⊆ V(G) is said to be a dominating set of G if N(v) ∩ D = ∅ for every v ∈ V(G) \ D. Let D(G) be the set of dominating sets of G. The domination number of G is defined to be the following.
We define a γ(G)-set as a set D ∈ D(G) with |D| = γ(G). The same agreement will be assumed for optimal parameters associated with other characteristic functions or sets of a graph. For more information on domination and its variants in graphs, we suggest the books [1][2][3][4].
An important domination variant in graph, which may be the most studied, is the total domination number. A total dominating set of G is a set D ∈ D(G) such that N(v) ∩ D = ∅ for every v ∈ D. Let D t (G) be the set of total dominating sets of G. The total domination number of G is defined to be the following.
More information on total domination in graphs can be found in the works [5][6][7]. Let G be a graph with no isolated vertex and f : V(G) → {0, 1, 2} a function. For every i ∈ {0, 1, 2}, we define V i = {v ∈ V(G) : f (v) = i}. We will use the unified notation f (V 0 , V 1 , V 2 ) to identify the function f with the subsets V 0 , V 1 , V 2 associated with it. Given a set X ⊆ V(G), we define f (X) = ∑ x∈X f (x) and, particularly, we define the weight of f as ω( f ) = f (V(G)) = |V 1 | + 2|V 2 |. One of the domination topics widely studied by research is the Roman domination, which is a domination variant arising from some historical roots coming from the ancient Roman Empire [8].
The Roman domination number of G denoted by γ R (G) is the minimum weight among all Roman dominating functions on G. For more information on Roman domination in graphs, we suggest the referenced works [9][10][11][12].
One of the classical variants of Roman domination is the so-called total Roman domination. This article deals precisely with this style of domination. A total Roman dominating function (TRDF) on a graph G with no isolated vertex is a Roman dominating function The minimum weight among all TRDFs on G is the total Roman domination number of G and is denoted as γ tR (G). This concept was introduced in 2013 by Liu and Chang [13] and formally presented and deeply studied three years later by Abdollahzadeh Ahangar et al. [14]. Subsequently, several researchers have continued with the study of this parameter. For instance, in [15][16][17], some combinatorial results were presented. In [18][19][20][21], constructive characterizations in trees related with this domination parameter were provided. In [22][23][24][25], studies of the total Roman domination number on graph products were carried out. In particular, we want to highlight the following closed formula provided in [25] for the case of lexicographic product graphs.
For any graph G with no isolated vertex and any nontrivial graph H, the total Roman domination number of the lexicographic product graph G • H is given by the following [25]: where ξ(G) = min{|A| + 2|B| : B ∈ D(G) and A ∪ B ∈ D t (G)}. As it can be observed, the authors [25] showed that the behavior of γ tR (G • H) depends on two domination parameters of graphs, namely the well-known total domination number and the incipient parameter ξ(G). In that regard, the authors exposed some results on this last parameter and they raised the challenge of conducting a detailed study of the topic.
In this paper, we continue with the study of this novel parameter although it will be carried out by considering a different approach. In Section 2 we define a new variant of total Roman domination, namely strongly total Roman domination number and denoted by γ s tR (G). We then show that this variant is an appropriate framework to investigate the parameter ξ(G) of a graph. Section 3 is devoted to providing closed formulas for some product graphs. As a consequence of the study, we conclude this section by showing that the problem of computing γ s tR (G) is NP-hard. Finally, in Section 4 we obtain tight bounds on the strongly total Roman domination number of a graph and we discuss the tightness of these bounds.
We assume that the reader is familiar with the basic concepts and terminology of graph domination. If this is not the case, then we suggest the textbooks [1,4]. For the remainder of the article, definitions will be introduced whenever a concept is required.

Strongly Total Roman Dominating Functions
The concept of a total Roman dominating function on a graph is associated with the "total domination" property, i.e., this kind of functions requires that each vertex has a neighboring vertex with a positive label assigned to it. However, some vertices have a "special property", which in some cases others do not have. In particular, vertices with label zero must always have a neighbor with label two, but it is not always the case that a vertex with label one satisfies this property. In relation to the above situation, we introduce a "stronger" version of the standard total Roman domination below.
A strongly total Roman dominating function (STRDF) on a graph G with no isolated vertex is a total Roman dominating function f (V 0 , V 1 , V 2 ) with the additional property that V 2 is a dominating set of G. The minimum weight among all STRDFs on G is the strongly total Roman domination number of G and is denoted γ s tR (G). To illustrate this concept, we consider the graph G shown in Figure 1. For this example, γ tR (G) < γ s tR (G). Now, we proceed to show that this new domination variant is an appropriate framework to investigate the parameter ξ(G).

Theorem 1. For any graph G with no isolated vertex,
Proof. Let f (V 0 , V 1 , V 2 ) be a γ s tR (G)-function. By definition we have that V 2 ∈ D(G) and V 1 ∪ V 2 ∈ D t (G). Therefore, the following obtains.
To end this section and as a consequence of previous theorem, we show the basic results given in [25] for the strongly total Roman domination number.
Theorem 2. Ref. [25] For any graph G with no isolated vertex, Furthermore, if and only if there exists a γ t (G)-set that contains some γ(G)-set.

Exact Formulas for Some Graph Products and Computational Complexity
In order to show the tightness of several bounds and relationships, in this section we obtain the strongly total Roman domination number concerning a well-know families of graphs. We emphasize that we will use the notation K n , K 1,n−1 , K r,n−r and W n for complete graphs, star graphs, complete bipartite graphs and the wheel graphs of order n, respectively.
The join graph G + H of the graphs G and H is the graph with vertex set
The following corollary is an immediate consequence of the theorem above. Corollary 1. The following equalities hold for any integer n ≥ 3.
Let G be a graph with no isolated vertex and H is any graph. The corona product graph G H is defined as the graph obtained from G and H, by taking one copy of G and |V(G)| copies of H and joining by an edge every vertex from the ith-copy of H with the ith-vertex of G. Next, we study the strongly total Roman domination number of any corona product graph. Proof. First, we notice that γ t (G H) = γ(G H) = n(G). Hence, Theorem 2 leads to the equality γ s tR (G H) = 2n(G). Therefore, the proof is complete.
Let G be a graph with no isolated vertex and H a nontrivial graph. The lexicographic product of G and H is the graph G • H for which the vertex set is V(G • H) = V(G) × V(H) and two vertices (u, v), (x, y) ∈ V(G • H) are neighbors if and only if ux ∈ E(G) or u = x and vy ∈ E(H).

Theorem 5.
Ref. [26] For any graph G with no isolated vertex and any nontrivial graph H, We next show that the strongly total Roman domination number and the total Roman domination number coincide for lexicographic product graphs. Theorem 6. For any graph G with no isolated vertex and any nontrivial graph H, Proof. If γ(H) ≥ 2, then the result immediately follows by applying Equation (1) and Theorems 2 and 5, i.e., we have the following.
From this moment on, we assume that γ(H) = 1. By Equation (1) and Theorems 1 and 2 we deduce that γ s , which completes the proof.
As shown in [27], the general optimization problem of computing the total domination number of a graph with no isolated vertex is NP-hard. Therefore, by Theorem 6 (considering the case γ(H) ≥ 2) we immediately obtain the analogous result for the strongly total Roman domination number.

Theorem 7.
The problem of computing the strongly total Roman domination number of a graph with no isolated vertex is NP-hard.

Primary Combinatorial Results
The first result of this section provides bounds for the strongly total Roman domination number in terms of the order of a graph. For this purpose, we need to recall the following well-known result.
Theorem 8. Ref. [5] If G is a connected non-complete graph of order at least three, then G has a γ t (G)-set D such that every vertex v ∈ D satisfies epn(v, D) = ∅ or is adjacent to a vertex v ∈ ipn(v, D) satisfying epn(v , D) = ∅. Proof. The lower bound is straightforward. Now, we proceed to prove the upper bound. If G is isomorphic to a complete graph, then γ s tR (G) = 3 ≤ n(G), as desired. From this moment, we assume that G is different of a complete graph. Let D be a γ t (G)-set which satisfies Theorem 8 and D = V(G) \ D. Now, we consider the following sets. Let us define f (V 0 , V 1 , V 2 ) as a function of minimum weight among all functions f (V 0 , V 1 , V 2 ) on G satisfying the following conditions.
By (a), it is straightforward that V 1 ∪ V 2 ∈ D t (G). By (b) and (c) we deduce that every vertex in V 0 = D has a neighbor in V 2 . Now, let v ∈ V 1 . By definition, v ∈ D \ D e and thus Theorem 8 results in N(v) ∩ D e = ∅. Hence, N(v) ∩ V 2 = ∅ by (b). This implies that V 2 ∈ D(G). Therefore, f is a STRDF on G and thus γ s tR (G) ≤ ω( f ). We only need to prove that ω( f ) ≤ n(G). Let v ∈ D \ D e . By definition, we have that N(v) ∩ D ⊆ D \ D e and |N(v) ∩ D| ≥ 2. Hence, by (a) and (c) we deduce that Thus, the minimality of f results in |V 2 \ D e | ≤ |D \ D e | and it is straightforward that |V 2 ∩ D e | ≤ |D e | ≤ |D e |. Therefore, the following is as required. Hence, the proof of the upper bound is complete. We then proceed to prove (i). By Theorem 2 we deduce that γ s tR (G) = 3 if and only if γ(G) = 1. Hence, (i) follows.
The upper bound above is tight. For instance, it is achieved for the graph G given in Figure 1. Moreover and as an immediate consequence of Theorems 2 and 9, it is also achieved for the graphs G with γ tR (G) = n(G). This family is defined in [14].
We continue by providing additional upper bounds. As shown in Theorem 2, the strongly total Roman domination number is bounded from above by 3γ(G). Since γ R (G) ≤ 2γ(G), the next result improves this upper bound for any graph G with no isolated vertex. We need to introduce the following result.
Theorem 10. Ref. [9] Let f (V 0 , V 1 , V 2 ) be a γ R (G)-function on a graph G with no isolated vertex such that |V 1 | is minimum. Then the following conditions hold. Theorem 11. For any graph G with no isolated vertex, Proof. Let f (V 0 , V 1 , V 2 ) be a γ R (G)-function such that |V 1 | is minimum. Hence, conditions (a) and (b) of Theorem 10 are satisfied. Now, we consider a function g (W 0 , W 1 , W 2 ) of minimum weight among all functions g(W 0 , W 1 , W 2 ) on G such that the following conditions are satisfied: We proceed to prove that g is a STRDF on G. By definitions of f and g , it is straight- Hence, W 2 ∈ D(G), which implies that g is a STRDF on G, as desired. Thus, γ s tR (G) ≤ ω(g ). Now, let D be a γ(G)-set. Hence, N[v] ∩ D = ∅ for every v ∈ V(G). In addition, notice that N(v) ∩ (W 2 \ V 2 ) = ∅ for every v ∈ V 1 . Thus, by (ii) and (iii), conditions (a) and (b) of Theorem 10 and the minimality of g , we deduce that 2|W 2 \ V 2 | + |W 1 | ≤ |V 1 | + |D|. From the inequalities above we obtain Therefore, the proof is complete.
The bound above is tight. For instance, it is achieved for any graph G = G 1 + G 2 such that γ(G 1 ) = 1. In this case, Theorem 3 results in γ s tR (G) = 3 = γ R (G) + γ(G). The following characterization is an immediate consequence of Theorem 11 and the well-known inequality γ R (G) ≤ 2γ(G). From Theorem 4 and the fact that for any graph G 1 with no isolated vertex and any nontrivial graph G 2 . This previous equality chain shows that the condition γ R (G) = 2γ(G) is a necessary condition but is not sufficient to satisfy γ s tR (G) = 3γ(G). We continue the study by providing a new upper bound, which improves the classical inequality γ s tR (G) ≤ 2γ t (G). We need to introduce some concepts and tools. For any γ t (G)-set D, let D * ⊆ D be a set of minimum cardinality such that D * ∈ D(G). Observe that D * is not necessarily a γ(G)-set. For instance, for the graph G given in Figure 2 we have that γ t (G) = 4 and γ(G) = 3. However, the set D of black-colored vertices is the only γ t (G)-set; moreover, the only dominating set that is a subset of D is D itself. We define K G (D) = D \ D * as the kernel of D. The maximum cardinality among all kernels K G (D) from all γ t (G)-sets D is the kernel of G and it is denoted by k(G). For instance, k(G 1 G 2 ) = 0 and also if γ(G 1 + G 2 ) = 1, then k(G 1 + G 2 ) = 1.

Theorem 13.
For any graph G with no isolated vertex, Therefore, the proof is complete.
The following result provides a necessary condition for the graphs G satisfying γ s tR (G) = 2γ t (G).

Theorem 14.
Let G be a graph of order at least three with no isolated vertex. If γ s tR (G) = 2γ t (G), then epn(v, D) = ∅ for every γ t (G)-set D and v ∈ D.
The following results provide lower bounds for the strongly total Roman domination number in terms of order, maximum degree and total domination number of a graph.
Theorem 15. For any graph G with every component of order at least three, Therefore, we deduce that γ s tR (G) ≥ γ t (G) + n(G)−γ t (G) ∆(G)−1 , which completes the proof.
In order to show a class of graphs satisfying the equality in the previous bound, we consider the corona product graphs K 2 H. For these graphs we obtain that because γ s tR (K 2 H) = 4 by Theorem 4, γ t (K 2 H) = 2, n(K 2 H) = 2n(H) + 2 and ∆(K 2 H) = n(H) + 1.
In [15], the authors showed that γ tR (G) ≥ 2n(G) ∆(G) for any graph G with no isolated vertex. The following result is a direct consequence of this previous inequality and Theorems 2, 5 and 15.

Theorem 16.
For any graph G with no isolated vertex, Furthermore, if γ t (G) = n(G) ∆(G) , then the previous bound is achieved.
The next theorem shows another relationship between our parameter and the order, maximum degree and total domination number of a graph. This result improves the bound given in the previous theorem whenever γ t (G) ≥ 2n(G) ∆(G) .
The bound above is tight. For instance, it is achieved for any graph G such that ∆(G) = n(G) − 1.

Conclusions and Open Problems
In this article we introduced the concept of strongly total Roman domination number and showed that this parameter is an appropriate framework to study the total Roman domination number of lexicographic product graphs. Moreover, we obtained new tight bounds and provided exact formulas for some product graphs. As a consequence of this study, we showed that the problem of computing γ s tR (G) is NP-hard. We next propose some open problems which we consider to be interesting: (i) Since the optimization problem of finding γ s tR (G) is NP-hard, it would be interesting to compute the value of this parameter for other families of graphs. (ii) We propose the problem of characterizing the graphs satisfying the following equalities: (a) γ s tR (G) = n(G); (b) γ s tR (G) = γ R (G) + γ(G); (c) γ s tR (G) = 2γ t (G) − k(G).
Author Contributions: The work was organized and led by A.C.M. All authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.
Funding: This research received no external funding.

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