Secure Total Domination in Rooted Product Graphs

: In this article, we obtain general bounds and closed formulas for the secure total domination number of rooted product graphs. The results are expressed in terms of parameters of the factor graphs involved in the rooted product.


Introduction
Recently, many authors have considered the following approach to the problem of protecting a graph [1][2][3][4][5][6][7]: suppose that one "entity" is stationed at some of the vertices of a (simple) graph G and that an entity at a vertex can deal with a problem at any vertex in its closed neighbourhood. In general, an entity could consist of a robot, an observer, a legion, a guard, and so on. Informally, we say that a graph G is protected under a given placement of entities if there exists at least one entity available to handle a problem at any vertex. Various strategies (or rules for entities placements) have been considered, under each of which the graph is deemed protected. As we can expect, the minimum number of entities required for protection under each strategy is of interest. Among these strategies we cite, for instance, domination [8,9], total domination [10], secure domination [1], secure total domination [2], Roman domination [6,7], Italian domination, [11] and weak Roman domination [5]. The first four strategies are described below.
The simplest strategies of graph protection are the strategy of domination and the strategy of total domination. In such cases, the sets of vertices containing the entities are dominating sets and total dominating sets, respectively. Typically, a vertex in a graph G = (V(G), E(G)) dominates itself and its neighbouring vertices. A set S ⊆ V(G) is said to be a dominating set of G if every vertex in V(G) \ S is dominated by at least one vertex in S, while S is said to be a total dominating set if every vertex v ∈ V(G) is dominated by at least one vertex in S \ {v}.
The minimum cardinality among all dominating sets of G is the domination number of G, denoted by γ(G). The total domination number, denoted by γ t (G), is defined by analogy. These two parameters have been extensively studied. For instance, we cite the following books, [8][9][10].
Let N(v) be the open neighbourhood of v ∈ V(G) and let S ⊆ V(G). In the case of the secure (total) domination strategy, a vertex v ∈ V(G) \ S is deemed (totally) protected under S ⊆ V(G) if S is a (total) dominating set and there exists u ∈ N(v) ∩ S such that (S ∪ {v}) \ {u} is a (total) dominating set. In such a case, in order to emphasise the role of vertex u, we say that v is (totally) protected by u under S. A set S ⊆ V(G) is said to be a secure (total) dominating set if every vertex in v ∈ V(G) \ S is (totally) protected under S.
For instance, let G be the graph shown in Figure 1, and suppose that an observer is stationed at vertex a and another one is stationed at b. In such a case, the graph is under the control of the observers, as its vertices are (i.e., {a, b} is a dominating set). Now, if the observer stationed at vertex a moves to any vertex in {c, d, e}, then the graph is under the control of the observers as well. In this case, {a, b} is a secure dominating set. Furthermore, if there are three observers and they are stationed at a, b, and c, then every vertex of the graph (including a, b, and c) is under the control of the observers, and this property is preserved if the observer stationed at c moves to d or e. Hence, {a, b, c} is a secure total dominating set. The minimum cardinality among all secure dominating sets of G is the secure domination number of G, denoted by γ s (G). This domination parameter was introduced by Cockayne et al. in [1] and studied further in a number of works including [12][13][14][15][16][17]. Now, the minimum cardinality among all secure total dominating sets of G is the secure total domination number of G, which is denoted by γ st (G). This parameter was introduced by Benecke et al. in [2] and studied further in [3,4,16,18,19].
A secure total dominating set of cardinality γ st (G) will be called a γ st (G)-set. A similar agreement will be assumed when referring to optimal sets associated to other parameters used in the article.
The problem of computing γ st (G) is NP-hard [18], even when restricted to chordal bipartite graphs, planar bipartite graphs with arbitrary large girth and maximum degree three, split graphs and graphs of separability at most two. This suggests finding the secure total domination number for special classes of graphs or obtaining tight bounds on this invariant. This is precisely the aim of this article in which we study the case of rooted product graphs.

Some Notation and Tools
All graphs considered in this paper are finite and undirected, without loops or multiple edges. The minimum degree of a graph G will be denoted by δ(G), i.e., δ(G) = min v∈V(G) |N(v)|. As usual, the closed neighbourhood of a vertex v ∈ V(G) is denoted by . By analogy with the notation used for vertices, the open neighbourhood of S ⊆ V(G) is the set N(S) = ∪ v∈S N(v), while the closed neighbourhood is the set The double domination number of G, denoted by γ ×2 (G), is the minimum cardinality among all double dominating sets of G. The k-domination number of a graph G, denoted by γ k (G), is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. Such sets are called k-dominating sets. Remark 1. Every secure total dominating set is a double dominating set and every double dominating set is a 2-dominating set. Therefore, for any graph G with no isolated vertex, γ st (G) ≥ γ ×2 (G) ≥ γ 2 (G).
By Remark 1, for every secure total dominating set S and every vertex v ∈ S, the set S \ {v} is a dominating set. Therefore, the following remark holds.
A leaf of G is a vertex of degree one. A support vertex of G is a vertex which is adjacent to a leaf and a strong support vertex is a support vertex which is adjacent to at least two leaves. A leaf is said to be a strong leaf if it is adjacent to a strong support vertex, otherwise it is called a weak leaf. The set of leaves, support vertices, strong leaves and weak leaves are denoted by L(G), S(G), L s (G), and L w (G), respectively.

Remark 3.
If D is a secure total dominating set of a graph G, then (S(G) ∪ L(G)) ⊆ D and no vertex of G is totally protected under D by vertices in S(G) ∪ L(G).
If v is a vertex of a graph H, then the vertex-deletion subgraph H − {v} is the subgraph of H induced by V(H) \ {v}. In Section 3 we will show the importance of γ st (H − {v}) in the study of the secure total domination number of rooted product graphs. Now we proceed to state some basic tools.
On the other hand, if there exists a γ st (H)-set S such that v / ∈ S, then S is a secure total dominating set of H − {v}, and so   In contrast to Remark 4, the following result shows the case where v is a strong leaf.  Therefore, the result follows.

The Case of Rooted Product Graphs
Given a graph G of order n(G) and a graph H with root vertex v, the rooted product graph G • v H is defined as the graph obtained from G and H by taking one copy of G and n(G) copies of H and identifying the i th vertex of G with the root vertex v in the i th copy of H for every i ∈ {1, 2, . . . , n(G)}.
If H or G is a trivial graph, then G • v H is equal to G or H, respectively. In this sense, hereafter we will only consider graphs G and H of order greater than or equal to two.
For every x ∈ V(G), H x ∼ = H will denote the copy of H in G • v H containing x. The restriction of any set S ⊆ V(G • v H) to V(H x ) will be denoted by S x , and the restriction to Theorem 1. For any graphs G and H with no isolated vertex and any v ∈ V(H), We now proceed to analyse three cases in which it is not difficult to give closed formulas for γ st (G • v H). Specifically, we consider the cases in which the root vertex v is a support vertex, a strong leaf, or a universal vertex. Theorem 2. The following statements hold for any graphs G and H with no isolated vertex.
for every x ∈ V(G), by Remark 3 we deduce that D x is a secure total dominating set of H x , and as a x is a secure total dominating set of H x − {x}, and so Remark 2 and Lemma 3 lead to |D In order to show that S = X ∪ W is a secure total dominating set of G • v H, we only need to observe that every vertex in V(G) \ S is totally protected under S by any neighbour in X, while every Given two graphs G and G , the corona graph G G can be seen as a rooted product graph G • v H where H is the join (The join graph G + G is the graph obtained from G and G by joining each vertex of G to all vertices of G ) graph K 1 + H and v is the vertex of K 1 . Therefore, Lemma 3 and Theorem 2 (ii) lead to the following result on corona graphs. Theorem 3. If G is a graph with no isolated vertex, then for every nontrivial graph G , As we will see later, the behaviour of γ st (G • v H) changes depending on whether the root vertex v is a weak leaf or not. First we proceed to consider the cases where the root vertex is not a weak leaf.
, then the following statements hold.
is a secure total dominating set of H x and, as above, we arrive to a contradiction. Therefore, The following corollary is a direct consequence of Theorem 2 (i).
Notice that Lemma 2 leads to x / ∈ L s (H x ). Thus, by Lemma 1 we conclude that Therefore, the result follows.
The following result states the intervals in which the secure total domination number of a rooted product graph can be found.

Theorem 4.
Let G and H be two graphs with no isolated vertex. At least one of the following statements holds for every v ∈ V(H) \ L w (H). In order to conclude the proof of (ii), we proceed to show that γ st (G • v H) ≤ γ st (G) + n(G)(γ st (H) − 1). To this end, we fix x ∈ B S , y x ∈ V(H x ) ∩ N(x ), a γ st (G)-set D and define a subset W of vertices of G • v H as follows. a) If x ∈ S, then for any x ∈ V(G) we set W ∩ V(G) = D and W − x is induced by S − x = S x . It is readily seen that the set W constructed in this manner is a secure total dominating set of It is readily seen that the set W constructed in this manner is a secure total dominating set of G • v H and, as a result, . Therefore, in this case (iii) holds.
In order to conclude that in this case (iii) holds, let us define a double dominating set D of G such that |D| ≤ 2|A S | + |B S |. Set D has minimum cardinality among the sets satisfying that A S ∪ B S ⊆ D and for any x ∈ A S , if N(x) ∩ C S = ∅, then there exists x ∈ N(x) ∩ C S ∩ D. Notice that every vertex in A S is dominated by at least one vertex in D and, by Lemma 4, every vertex in C S is dominated by at least two vertices in A S ∪ B S ⊆ D. Furthermore, if there exists one vertex x ∈ B S such that N(x) ∩ A S ∩ B S = ∅, then S x is a secure total dominating set of H x , which is a contradiction, as |S x | = • γ st (G • v P 7 ) = n(G) (γ st (P 7 ) − 1), where v is the central vertex of P 7 and G is a graph with • Theorem 5 gives some conditions to achieve the equalities γ st (G . In this case we can take H ∼ = H 2 . We now consider some particular cases in which we impose some additional restrictions on G and H. We begin with an immediate consequence of Theorem 4.

Theorem 5. Let G and H be two graphs with no isolated vertex and v
The following result considers the case in which γ st (H − {v}) ≥ γ st (H) − 1.  If |S x | ≥ γ st (H) for every x ∈ V(G), then Theorem 1 leads to γ st (G • v H) = n(G)γ st (H). Suppose that there exists a vertex x ∈ V(G) such that |S x | ≤ γ st (H) − 1. We define a set D ⊆ V(G • v H) as follows. For every z ∈ V(G), the restriction of D to V(H z ) is induced by S x . Notice that V(G) ⊆ D and, if δ(G) ≥ 2, then every vertex in V(H z ) \ D is totally protected under D by some vertex in D z , which implies that D is a secure total dominating set of G • v H. Therefore,

From now on we assume that δ(G) ≥ 2 and γ st (H − {v}) ≥ γ st (H). Let us distinguish between two cases, according to whether or not
Now, assume that there exists y ∈ V(G) ∩ S. Notice that Lemma 5 leads to C S = ∅. Hence, y ∈ A S ∪ B S . If y ∈ B S , we define a set D ⊆ V(G • v H) as follows. For every z ∈ V(G), the restriction of D to V(H z ) is induced by S y . As in Case 1, we deduce that D is a secure total dominating set of G • v H and so we can conclude that γ st (G  Suppose that there exists a vertex x ∈ B D . If x / ∈ D, then D − x is a secure total dominating set of which is a contradiction again. Therefore, B D = ∅, and we are done.

The Case in Which the Root Vertex is a Weak Leaf
The first part of this section is devoted to the case in which the support vertex of the root v has degree greater than or equal to three.
By Theorem 1 and Lemma 6, we deduce the next result.
The following result is an immediate consequence of the theorem above.
. We now consider the case x ∈ N 1 . By Lemma 6 we have that |S , which contradicts the hypothesis of (i). Hence, x ∈ N 1 leads to |S x | > γ st (H − {v}).
In summary, we can conclude that if x ∈ N 0 , then |S We claim that there exists a secure total dominating set Z of G such that |Z| ≤ |N 1 | + |M 0 | + 2|M 1 |.
We define Z as a set of minimum cardinality satisfying that N 1 ∪ M 0 ∪ M 1 ⊆ Z and for any x ∈ M 1 with N(x) ∩ N 0 = ∅ there exists w x ∈ N(x) ∩ N 0 ∩ Z. Notice that, by definition, Z is a double dominating set of G and, since δ(G) ≥ 2, every vertex in M 1 has at least two neighbours in Z \ N 0 or one neighbour in Z ∩ N 0 . Let x ∈ V(G) \ Z. Since x ∈ N 0 , there exists y ∈ S ∩ V(G) = M 1 ∩ N 1 ⊆ Z such that x is totally protected under S by y. We claim that Z = (Z \ {y}) ∪ {x} is a total dominating set of G. Since Z is a total dominating set of G, we have that every vertex in V(G) \ N(y) is dominated by some vertex in Z . Now, if there exists u ∈ N(y) ∩ V(G) such that N(u) ∩ S ∩ V(G) = {y}, then u ∈ M 1 , and so N(u) ∩ Z ∩ N 0 = ∅, concluding that Z is a total dominating set of G. Hence, Z is a secure total dominating set of G, and as a consequence, Therefore, proof of (i) is complete.
We now proceed to prove (ii). From Lemma 6 we can consider the partition {R 0 , R 1 } of V(G) defined as follows.
which is a contradiction. Hence, R 1 ∩ N 1 = ∅, and so N 1 ⊆ R 0 . Now, by hypothesis of (ii), M 0 ⊆ R 0 . Moreover, if x ∈ M 1 , then S − x is a secure total dominating set of H x − {x}, and so x ∈ R 1 . Therefore, R 1 = M 1 and R 0 = M 0 ∪ N 1 . Now, we suppose that there exists a vertex x ∈ N 1 . Let W ⊆ V(G • v H) such that W x is induced by S x for every vertex x ∈ V(G). Since δ(G) ≥ 2 we have that W is a secure total dominating set of From now on, we assume that N 1 = ∅. Hence, x is a secure total dominating set of H x − {x}, and by hypothesis of (ii) we deduce that |S − Since In this case, for every γ(G)-set X we have that X ∪ W is a secure total dominating set of G • v H. Hence |M 1 | = γ(G), and as a consequence, such that W x is induced by D for every vertex x ∈ V(G). In this case, for every γ t (G)-set X we have that X ∪ W is a secure total dominating set of G • v H. Hence |M 1 | = γ t (G). Therefore, From now on we consider the case in which the support vertex of the root v has degree two.
Therefore, with the assumptions above, Proof. We first consider the case in which S x is a secure total dominating set of H x . Since x ∈ L(H x ) we have that x belongs to every γ st (H x )-set. So, |S x | = γ st (H x ) = γ st (H). Now, assume that S x is not a secure total dominating set of H x . Notice that every vertex in V(H x ) \ (S ∪ {x}) is totally protected under S by some vertex in S x . Since {x, s x } ∩ S x = ∅, we have that S x ∪ {x, s x } is a secure total dominating set of H x . Hence, , then for any γ st (H x )-set D, we have that S = (S \ S x ) ∪ D is a secure total dominating set of G • v H and |S | < |S|, which is a contradiction. Therefore, γ st (H) − 1 ≤ |S x | ≤ γ st (H) for every x ∈ V(G), and since γ st (G • v H) = ∑ x∈V(G) |S x |, the result follows.
We now consider the particular case where δ(G) ≥ 2. By Lemma 7 we only need to consider two cases according to whether These two cases are discussed in Theorems 11 and 12, respectively. Theorem 11. Let G be a graph with δ(G) ≥ 2 and H a graph with no isolated vertex. Let v ∈ L w (H), We suppose that s y ∈ S y . Since |S y | = γ st (H) − 1, we deduce that s y / ∈ S y . So, the set D = (S y \ {y}) ∪ {s y } is a secure total dominating set of which is a contradiction. Hence, s y / ∈ S y , and so s y ∈ S y . Let W ⊆ V(G • v H) such that W x is induced by S y , for any x ∈ V(G). Since δ(G) ≥ 2, we deduce that W is a secure total dominating set of G • v H, and, as a result, γ st (G • v H) ≤ |W| = n(G)|S y | = n(G)(γ st (H) − 1). By Theorem 10 we obtain that γ st (G • v H) = n(G)(γ st (H) − 1), which completes the proof. , we can assume, without loss of generality, that N[s z ] ⊆ S z for every vertex z ∈ Z. We claim that Z is a dominating set of G. Let x ∈ V(G) \ Z and suppose that x ∈ S. In such a case, |S x | = γ st (H) − 1 and we can define a set W ⊆ V(G • v H) such that W x is induced by S x for every vertex x ∈ V(G). Notice that W is a secure total dominating set of G • v H and |W| = n(G)(γ st (H) − 1), which is a contradiction. Thus, (V(G) \ Z) ∩ S = ∅, which implies that Z is a dominating set of G and so γ st (G • v H) = |S| ≥ | ∪ x∈V(G) S x | = |Z| + n(G)(γ st (H) − 1) ≥ γ(G) + n(G)(γ st (H) − 1), which completes the proof. Proof. For any vertex x ∈ V(G), let {s x } = N(x) ∩ V(H x ) and notice that any γ st (H x )-set D x satisfies that N[s x ] ⊆ D x and D x \ {x, s x } is a secure total dominating set of H x − {x, s x }. Since δ(G) ≥ 2, we have that D = x∈V(G) (D x \ {s x }) is a secure total dominating set of G • v H. Hence, γ st (G • v H) ≤ |D| = n(G)(γ st (H) − 1). By Theorem 10 we obtain that γ st (G • v H) = n(G)(γ st (H) − 1), which completes the proof.

Concluding Remarks
It is well-known that the problem of finding the secure total domination number of a graph is NP-hard. This suggests the challenge of finding closed formulas or giving tight bounds for this parameter. In this paper we develop the theory for the class of rooted product graph. The study shows that if the root vertex is strong leaf, a support, or a universal vertex, then there exists a formula for the secure total domination number of the rooted product graph. In the remaining cases, two different behaviours are observed depending on whether the root vertex is a weak leaf or not. Although in a different way, in both cases we were able to give the intervals to which the parameter belongs. The endpoints of these intervals are expressed in terms of other domination parameters of the graphs G and H involved in the product, which allows us to obtain closed formulas when certain conditions are imposed on G or H.