Total Mutual-Visibility in Graphs with Emphasis on Lexicographic and Cartesian Products

Given a connected graph G, the total mutual-visibility number of G, denoted μt(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu _t(G)$$\end{document}, is the cardinality of a largest set S⊆V(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S\subseteq V(G)$$\end{document} such that for every pair of vertices x,y∈V(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x,y\in V(G)$$\end{document} there is a shortest x, y-path whose interior vertices are not contained in S. Several combinatorial properties, including bounds and closed formulae, for μt(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu _t(G)$$\end{document} are given in this article. Specifically, we give several bounds for μt(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu _t(G)$$\end{document} in terms of the diameter, order and/or connected domination number of G and show characterizations of the graphs achieving the limit values of some of these bounds. We also consider those vertices of a graph G that either belong to every total mutual-visibility set of G or does not belong to any of such sets, and deduce some consequences of these results. We determine the exact value of the total mutual-visibility number of lexicographic products in terms of the orders of the factors, and the total mutual-visibility number of the first factor in the product. Finally, we give some bounds and closed formulae for the total mutual-visibility number of Cartesian product graphs.


Introduction
Vertex visibility in networks is a topic that has motivated a significant number of investigations in the last few years.These investigations have been taken into account from two different points of view.In one hand, the research has been conducted in practical problems appearing in the area of computer science, through the study of some robot navigation models, mainly focused on the visibility required for some robots to move around a network in order to avoid collisions.For some examples of researches on this topic we suggest for instance [1,2,5].In a second hand, a theoretical point of view has been considered, where the investigation mainly concentrates the attention into finding combinatorial properties of "visible" sets in networks.The first ideas on this direction were presented in [6], where the concept of mutual-visibility number in graphs was introduced.This latter style of theoretical study was extended in [3,4].
Let G = (V (G), E(G)) be a connected and undirected graph, X ⊆ V (G), and x, y ∈ X.If there exists a shortest x, y-path (also called geodesic) whose internal vertices are all not in X, then x and y are X-visible.The set X is a mutual-visibility set of G, if every two vertices x and y of X are X-visible.The cardinality of the largest mutual-visibility set of G is the mutual-visibility number of G denoted by µ(G).
The topic of mutual-visibility in graphs is closely related to the general position problem in graphs, which was formally, independently and recently defined in [10,17], although its notion is already known from previous investigations, like for instance [12], where the concept was considered only for hypercubes.A general position set in a graph G can be understood as a mutual-visibility set in G in which any two vertices of such set are "visible" not only through at least one shortest path but through every possible shortest path between the two vertices.The general position problem has been intensively studied in the last 5 years, and by now there are many ongoing investigations on this topic and its variations.For some significant cases, we suggest some of the most recent ones [7,9,11,13,14,16].
In order to give more insight into the mutual-visibility number of strong product graphs, Cicerone et al. [4] introduced the notion of total mutual-visibility as a natural extension of the mutual-visibility, which can also be seen in a computer setting navigation model, where not only the robots are required to be "visible" with respect to themselves, but also the remaining nodes of the networks have a similar property among them, and with respect to the navigating robots.This setting is clearly more restrictive, but it surprisingly turns to become very useful while considering some networks having some Cartesian properties in the vertex set, namely, that ones of product-like structures, when a product is understood in the sense of the four classical graph products as defined in the book [8].
As it happens, the concept of total mutual-visibility might be also of independent interest, as already pointed out in [4], since the visibility is extended to all vertices in the graph, not only for the vertices from mutual-visibility set.This is clearly a property of independent interest, and its study is worthy of being continued.This was indeed already done in [15], and it is our goal to continue finding more contributions on this regard.Formally, X ⊆ V (G) is a total mutual-visibility set of G, if every two vertices x and y of G are X-visible.A largest total mutual-visibility set of G is a µ t (G)-set, its cardinality is the total mutual-visibility number of G denoted by µ t (G).
We now give some basic terminology and basic definitions that shall be used through our whole exposition.Clearly, we continue considering here only connected and undirected graphs.Given a graph G and two vertices x, y ∈ V (G), the distance d G (x, y) between x and y in G is the length of a shortest x, y-path.The diameter diam(G) of G is the largest distance between pairs of vertices of G.The subgraph of G induced by S ⊆ V (G) will be denoted by G[S] and the complement of a graph G is G.A subgraph H of G is convex if for each two vertices x, y ∈ V (H), all shortest x, y-paths in G lie completely in H.As usual, the domination number of G is denoted by γ(G), which is the cardinality of a smallest set such that any vertex not in the set is adjacent to at least one vertex of such set.By n 1 (G) we denote the number of vertices of degree one in G, also known as the number of leaves of G, when G is a tree.We next continue with some extra information (basic results) that we would need for our purposes.
We first recall that there exist graphs where X = ∅ is the only µ t (G)-set, like the case of cycles of order at least 5, and graphs where X = V (G) is the only µ t (G)-set, like the case of complete graphs.Thus, for any graph G, 0 ≤ µ t (G) ≤ n(G), where n(G) denotes the order of G. Also, the following observation from [15] is of interest.Proposition 1.1.[15] If X ⊆ V (G) is a total mutual-visibility set of a graph G and Y ⊆ X, then Y is also a total mutual-visibility set of G.
To close this section we present the plan of our article.In Section 2, several bounds for µ t (G) in terms of the diameter, order and/or connected domination number of G are given.We also show characterizations of the graphs achieving the limit values of some of these bounds, and present some consequences that gives the exact value of µ t (G) when G is a join or a corona graph.Section 3 is dedicated to consider those vertices of a graph G that either belong to every total mutualvisibility set of G or does not belong to any of such sets.In Section 4 we consider the lexicographic product of graphs G and H, and compute the exact value of its total mutual-visibility number in terms of the orders of G and H and the total mutual-visibility number of G.In Section 5, we give some bounds and closed formulae for the total mutual-visibility number of Cartesian product graphs.We determine such value for some specific families of graphs that are generalizing some other results recently presented in [15].Finally, in the concluding section some open problems and directions for further investigation are indicated.

General bounds and consequences
Our first contribution describes a relationship between the total mutual-visibility number and the diameter of a graph.
Theorem 2.1.For any connected graph G, Proof.By definition of total mutual-visibility number, µ t (G) ≥ 0. Now, let X be a µ t (G)-set.If u, v ∈ V (G) are two diametral vertices, then there exists a diametral path u = x 0 , . . ., All graphs with µ t (G) = 0 were characterized in [15].Next we consider the case of graphs with µ t (G) = n(G) − diam(G) + 1. Proposition 2.2.Given a connected graph G of order n(G) ≥ 2, the following statements are equivalent.
Proof.First, we assume that (i) holds.Let X be a µ t (G)set.Let x, y ∈ V (G) be two diametral vertices.Since x and y are X-visible, there exists a path P between x and y whose set Y of internal vertices satisfies X ∩ Y = ∅.Hence, Y ⊆ V (G) \ X, and so from (i) we deduce that Therefore, X = V (G) \ Y , which implies that P satisfies (ii).
Conversely, if W is the set of internal vertices of a diametral path P satisfying In such a case, by Theorem 2.1 we deduce that (i) holds.
From Proposition 2.2 we deduce the following result which characterizes the graphs with large values of total mutual-visibility number.
Corollary 2.3.Given a graph G, the following statements hold.
Now, we establish an interesting connection between the total mutual-visibility number and the connected domination number, denoted by γ c (G), which represents the minimum cardinality among all dominating sets of G whose induced subgraphs are connected.A smallest connected dominating set of G is a γ c (G)-set.
Theorem 2.4.For any connected non-complete graph G, Since G is a non-complete graph, by Theorem 2.1 and Corollary 2.3, we deduce that X ′ = ∅.If there exists x ∈ X such that N(x) ∩ X ′ = ∅, then for every x ′ ∈ X ′ we have that x and x ′ are not X-visible, which is a contradiction.Hence, X ′ is a dominating set.Now, if x ′ and x ′′ are vertices of two different components of the subgraph of G induced by X ′ , then x ′ and x ′′ are not X-visible, which is a contradiction again.Thus, It is easy to construct examples of graphs achieving the bound above.In particular, as we will show in Theorem 2.9, the bound is achieved for connected corona graphs.

Proof. Since any path between two diametral vertices has diam
The converse of Corollary 2.5 does not hold.For instance, if G is the graph shown in Figure 1 Proposition 2.6.Given a connected non-complete graph G, the following statements are equivalent.
(ii) There exists a γ c (G)-set S such that for every pair u, v of vertices of G there exists a shortest path u = y 0 , . . ., Proof.First, we assume that (i) holds.Let X be a µ t (G)-set and As we have shown in the proof of Theorem 2.4, X ′ is a connected dominating set, and so from (i) we deduce that Therefore, X ′ is a γ c (G)-set which satisfies (ii).Conversely, if S is a γ c (G)-set satisfying (ii), then V (G) \ S is a total mutualvisible set, which implies that n(G) − γ c (G) = |V (G) \ S| ≤ µ t (G).In such a case, by Theorem 2.4 we deduce that (i) holds.
Notice that from Proposition 2.6 we deduce the following result which was recently obtained in [15].Corollary 2.7.[15] For any tree T of order at least three, µ t (T ) = n 1 (T ).
Next we will apply Proposition 2.6 to the cases of join and corona graphs.The join graph G + H is defined as the graph obtained from the disjoint union of a copy of G and a copy of H by adding an edge between each vertex of G and each vertex of H. Corollary 2.8.Let G and H be two non-simultaneously complete graphs.
Proof.Since every universal vertex of G is a universal vertex of G + H, from Proposition 2.6 or from Corollary 2.3, we deduce (i).Now, if γ(G) = 1 and γ(H) = 1, then γ c (G + H) = 2 and we only need to observe that for any vertex g ∈ V (G) and any vertex h ∈ V (H), the set {g, h} is a connected dominating set of G + H which satisfies Proposition 2.6 (ii).
Let G and H be graphs where V (G) = {u 1 , . . ., u n(G) }.The corona product G ⊙ H is defined as the graph obtained from the disjoint union of a copy of G and n(G) copies of H, denoted by H i , i ∈ {1, 2, . . ., n(G)}.The product G ⊙ H is then constructed by making u i adjacent to every vertex in H i for each i ∈ {1, 2, . . ., n(G)}.Notice that the corona product K 1 ⊙ H is isomorphic to the join graph K 1 + H. Corollary 2.9.For any connected graph G and any graph H, Proof.We only need to observe that V (G) is a γ c (G ⊙ H)-set which satisfies Proposition 2.6 (ii).

Compulsory vertices and forbidden vertices in any µ t (G)-set
In order to give some additional results on the total mutual-visibility number of a graph, we need to introduce the following notation.Given a graph G, we define the set F (G) ⊆ V (G) as the set of forbidden vertices in any µ t (G)-set, i.e., the set of vertices not belonging to any µ t (G)-set.
We also define C(G) as the set of compulsory vertices in any µ t (G)-set, i.e., the set of vertices belonging to every µ t (G)-set.
If X is a µ t (G)-set, then by definition of C(G) and F (G) we have that C(G) ⊆ X ⊆ V (G) \ F (G). Therefore, the following proposition follows.
Although the following statement is also immediate, it is very useful.Proposition 3.2.Given a graph G, the following statements are equivalent.
Proof.If (i) ⇔ (ii) holds, then the other equivalences are deduced by Proposition 3.1.Therefore, we will limit ourselves to prove the equivalence (i) ⇔ (ii).
Let X be a A vertex of a graph is a simplicial if the subgraph induced by its neighbors is a complete graph.Let S(G) be the set of simplicial vertices in G. Observe that S(G) ⊆ C(G).Let P(G) be the subset of V (G) such that v ∈ P(G) if and only if there exist two vertices u, w ∈ Notice that the problem of deciding if a vertex belongs to S(G), or to P(G), is algorithmically simple.Therefore, the following result is an important tool to estimate the value of µ t (G).Proposition 3.3.Given a connected graph G, the following statements hold.
Proof.From Propositions 3.1 and 3.2 we deduce (i), (iii) and (iv).We proceed to prove (ii).Since S(G) ⊆ C(G), if µ t (G) = |S(G)|, then the set S(G) of simplicial vertices is the only µ t (G)-set.If there exists a vertex x ∈ V (G)\(S(G)∪P(G)), then for every pair of non-adjacent vertices y, z ∈ N G (x), there exists w ∈ V (G) \ S(G) such that y, z ∈ N G (w), and so S(G) ∪ {x} is a total mutual-visibility set, which is a contradiction.Therefore, V (G) = S(G) ∪ P(G), as required.
The graph G shown in Figure 1 is also an example which illustrates Proposition 3.3 (ii).The set S(G) is formed by the bold vertices, and P(G) by the white ones.Moreover, as previously mentioned, µ t (G) = 2.
As we can expect, the converse of Proposition 3.3 (ii) does not hold.For instance, if G is the graph shown in Figure 2, then S(G) = {a, g} ⊆ {a, d, g, i} = C(G) and Notice also that the converse of Proposition 3.3 (iv) does not hold.For instance, if G is the graph shown in Figure 3, then P(G) = {b, c, e, f, h, j} ⊆ {b, c, e, f, h, j, k} = F (G).In this case, Since the vertex set of any non-complete block graph G can be partitioned as V (G) = P(G) ∪ S(G), we deduce the following result.

The case of lexicographic product graphs
The lexicographic product G • H of two graphs G and H is a graph with vertex set V (G•H) = V (G)×V (H).Two vertices (x, y) and (x ′ , y ′ ) are adjacent if xx ′ ∈ E(G) or (x = x ′ and yy ′ ∈ E(H)).The lexicographic product is a kind of generalization of join because Since the concept of total mutual-visibility is defined for connected graphs, we should remember that a lexicographic product G • H is connected if and only if G is connected.Moreover, the relation between distances in a lexicographic product graph and in its factors can be presented as follows.
Remark 4.1.[8] If G is a connected non-trivial graph, then the distance between two vertices (g, h) and For more on the product graphs see [8].
Lemma 4.2.Let G be a graph with γ(G) ≥ 2 and let H be a graph.If X is a Proof.Let u ∈ V (G).By the maximality of the cardinality of X, if there exist two , and so two vertices (u, v) and (w, v) are not X-visible, which is a contradiction.Therefore, the result follows.
Lemma 4.3.Let G be a graph with γ(G) ≥ 2. For any µ t (G)-set X and any vertex Proof.Suppose that there exits a µ t (G)-set X, and a vertex v ∈ V (G), such that . Hence, u and v are not X-visible, which is a contradiction.Theorem 4.4.Let G be a connected graph with γ(G) ≥ 2. For any graph H, Proof.Let S be a µ t (G)-set and let v ∈ V (H).We proceed to show that X = S ×V (H)∪(V (G)\S)×(V (H)\{v}) is a total mutual-visibility set.We differentiate two cases for (u, v), (u ′ , v ′ ) ∈ V (G • H).Case 1: u = u ′ .By Lemma 4.3 there exists a vertex w ∈ N G (u) ∩ (V (G) \ S).Thus, the vertices (u, v) and (u ′ , v ′ ) are X-visible.
Therefore, X is a total mutual-visibility set, and so Let W be a µ t (G•H)-set and G is a total mutual-visibility set of G.For every pair of different vetices x, x ′ ∈ V (G) and y ∈ V (H), there exists a shortest path (x, y) = (x 0 , y 0 ), . . ., (x k , y k ) = (x ′ , y) such that (x 1 , y 1 ), . . ., Hence, the pair of vertices x and x ′ are W G -visible and so |W G | ≤ µ t (G).Therefore, by Lemma 4.2 we have that Proof.Let u be a universal vertex of G.If v is a a universal vertex of H, then (u, v) is a universal vertex of G • H, and so by Corollary 2.3 we conclude that (i) follows.
In order to prove (ii), we take an arbitrary vertex u ′ ∈ V (G) \ {u} and an arbitrary vertex v ∈ V (H), and since u is a universal vertex of G, it is readily seen that which completes the proof of (ii).

The case of Cartesian product graphs
Let G and H be two graphs.The Cartesian product of G and H is the graph G✷H with V (G✷H) = V (G) × V (H), where two vertices (x, y) and (x ′ , y ′ ) are adjacent if and only if either x = x ′ and yy ′ ∈ E(H), or xx ′ ∈ E(G) and y = y ′ .A Cartesian product graphs is connected if and only if both of its factors are connected.The distance between (x, y) and (x ′ , y ′ ) in G✷H is given by For more information on structure and properties of the Cartesian product of graphs we refer the reader to [8].
We recall that the general position and the mutual-visibility problems were investigated recently, for instance in [7,11,16] and [3], respectively.Moreover, Tian and Klavžar [15] most recently studied the total mutual-visibility number of Cartesian product graphs.In the referred work, the authors gave general bounds on the total mutual-visibility number of Cartesian product graphs, and they also obtain closed formulas on this novel parameter for specific families of Cartesian product graphs.To continue our exposition we mention these bounds.For this sake, we need to introduce the following concept defined in [15].An independent total mutual-visibility set of a graph G is a set of vertices in G that is both an independent set and a total mutual-visibility set of G.The cardinality of a largest independent total mutual-visibility set is the independent total mutual-visibility number of G, denoted by µ it (G).
In order to present a result which improves the upper bound mentioned above, we need to state the following lemma.Lemma 5.2.For any connected graph G of order at least two, P(G) × V (H) ⊆ P(G✷H).
Theorem 5.4.Let G and H be two connected graphs.
As we will show below, the bound above is tight.
We next show a result which includes Theorem 5.5 as a particular case.Notice that for any tree T the only µ t (T )-set is the set of leaves (simplicial vertices) and clearly it is an independent set.Moreover, there exist numerous examples of graphs, where µ t (G) = |S(G)| and S(G) is an independent set, and among them we have, for instance, the corona products G ∼ = G * ⊙ K n , for any graph G * , and any graph G ′ obtained as follows.We begin with a Hamiltonian graph H * with Hamiltonian cycle v 0 v 1 . . .v n(H * )−1 v 0 and n(H * ) vertices u 0 , u 1 , . . .u n(H * )−1 .Then to form G ′ we join each vertex u i with v i and v i+1 , for i ∈ {0, 1, ..., n(H * ) − 1} (where the operations with the subscripts i are expressed modulo n(H * )).Notice that every vertex of H * belongs to P(G ′ ).
Theorem 5.6.If S(G) is an independent set of G and µ t (G) = |S(G)|, then Proof.The result is obtained by combining the upper bound given by Theorem 5.4 and the lower bound given by Theorem 5.1.
Corollary 5.7.If T 1 ,. . .,T k is a family of trees of order at least three, then We will now establish the following lemma, which will be one of our tools.
Lemma 5.8.Let x, x ′ be two adjacent vertices of a graph G and let y, y ′ be two adjacent vertices of a graph H.If X is a µ t (G✷H)-set and (x, y) ∈ X, then (x ′ , y ′ ) ∈ X.
The set S(G) of simplicial vertices of a graph G can be partitioned into true twin equivalence classes where two vertices g, g ′ ∈ S(G) belong to the same class if and only if they are true twins, i.e., whenever N G Theorem 5.9.Let G be a graph and let {C 1 , . . ., C k } be a partition of S(G) into true twin equivalence classes.If µ t (G) = |S(G)|, then for any integer n ≥ 2 Proof.Let v ∈ V (K n ) be a fixed vertex of K n and let u i ∈ C i be a representative vertex of the class C i .We define the following set.
We proceed to show that X is a total mutual-visibility set of G✷K n .To this end, we differentiate the following cases for two vertices (g, h), (g Case 1. g, g ′ ∈ C i for some class C i .Since the subgraph of G induced by C i is complete, the subgraph of G✷H induced by C i × V (K n ) is the Cartesian product of two complete graphs, and by the construction of X the subgraph induced by ) is also complete.Hence, it is readily seen that (g, h) and (g ′ , h ′ ) are X i -visible, and so they are X-visible.
Case 2. g ∈ C i for every class C i .Let g = g 0 , . . ., g l = g ′ and h = h 0 , . . ., h r = h ′ be two shortest paths.If g = g ′ , then the shortest path (g, h) = (g, h 0 ), . . ., (g, h r ) = (g ′ , h ′ ) does not have vertices in X.Now, assume g = g ′ .Notice that S(G) is a µ t (G)-set and, by Proposition 3.3 (ii), P(G) = V (G) \ S(G).Hence, the path g = g 0 , . . ., g l = g ′ is S(G)-visible, and by the construction of X, the path (g, h) = (g, h 0 ), . . ., (g, h r−1 ), (g, h ′ ), (g 1 , h ′ ) . . ., (g l , h According to the two cases above, X is a total mutual-visibility set of G✷K n , which implies that Now, let W be a µ t (G✷K n )-set.As mentioned above, V (G) = S(G) ∪ P(G) and, by Lemma 5.2, we know that P(G) × V (K n ) ⊆ P(G✷K n ), which implies that W ∩ (P(G) × V (K n )) = ∅.On the other side, since the subgraph of G induced by any class C i is complete, by Lemma 5.8 we can conclude that for any pair of different vertices x, x ′ ∈ C i and any pair of different vertices y, y Therefore, the result follows.
From Theorem 5.9 we derive the following result, which was recently obtained in [15].Based on the corollary above, one might think that the total mutual-visibility number of the Cartesian product of at least three complete graphs K n 1 , K n 2 , . . ., K n k (k ≥ 3) equals max{n 1 , n 2 , . . ., n k }.However, this seems to be far from the reality.To see this we consider the example K 3 ✷K 3 ✷K 2 .Figure 4 shows a total mutualvisibility set (in bold) of K 3 ✷K 3 ✷K 2 of cardinality 4 > max{3, 3, 2}.This situation allows to think that finding µ t (K n 1 ✷K n 2 ✷ • • • ✷K n k ) (in particular for Hamming graphs) is a challenging problem.If v ∈ V (K 2 ) and X is a µ t (G)-set, then X × {v} is a total mutual-visibility set of G✷K 2 .Hence, the lower bound µ t (G✷K 2 ) ≥ µ t (G) follows.Therefore, from Theorem 5.1 we derive the following remark.
From this remark we derive some open problems stated below.

Concluding remarks
In this article we have considered the total mutual-visibility number of graphs, by giving some tight bounds and closed formulae for this parameter.We have emphasized the investigation for the case of lexicographic and Cartesian product of graphs.Next, we propose some specific problems and possible research lines that can be taken as starting point for further researching on this topic.
• Investigate the behaviour of the total mutual-visibility number for the case of strong product graphs, direct product graphs, generalized Sierpiński graphs and Hamming graphs (with emphasis on hypercubes).
• Investigate how µ t (G) is related to parameters other than diam(G) and γ c (G).
• Characterize the vertices of a graph belonging to C(G) \ S(G) and derive consequences of these characterizations.
• Characterize the vertices of a graph belonging to F (G) \ P(G) and derive consequences of these characterizations.
• For connected graphs, whose complement is connected, study the existence of Nordhaus-Gaddum type relations.
• Study the complexity of computing µ t (G).

Figure 2 Figure 2 :
Figure 2 shows an example of graph which illustrates Proposition 3.2.