The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs

: A vertex w of a connected graph G strongly resolves two distinct vertices u , v ∈ V ( G ) , if there is a shortest u , w path containing v , or a shortest v , w path containing u . A set S of vertices of G is a strong resolving set for G if every two distinct vertices of G are strongly resolved by a vertex of S . The smallest cardinality of a strong resolving set for G is called the strong metric dimension of G . To study the strong metric dimension of graphs, a very important role is played by a structure of graphs called the strong resolving graph In this work, we obtain the strong metric dimension of some families of cactus graphs, and along the way, we give several structural properties of the strong resolving graphs of the studied families of cactus graphs.


Introduction
Topics concerning metric dimension and related parameters in graphs are nowadays very common in the research community, probably based on its applicability to diverse practical problems of identification of nodes in networks. One can find in the literature a large number of works dealing with this topic, both from the applied and theoretical points of views. A popular research line in this subject concerns studying different variants of metric dimension in graphs, which have had their beginnings in the seminal standard metric dimension concept. Some of the most recent ones are probably the edge metric dimension [1], the mixed metric dimension [2], the k-metric antidimension [3], the strong partition dimension [4], and the multiset dimension [5,6], just to cite a few recent and remarkable cases. One other interesting version is the strong metric dimension [7], which is now relatively well studied, although a few open questions on this are still open. A fairly complete study on results and open questions concerning the strong metric dimension of graphs can be found in [8].
One significant reason for the interest of several researchers in the strong metric dimension of graphs concerns the closed relationship that exists between such parameter and the very well known vertex cover number of graphs (and thus with the independence number, based on the Gallai's Theorem). To see this relationship, for a given graph G, the construction of a new related graph, called strong resolving graph, was required. This graph transformation clearly raised some other related questions on the transformation itself. That is for instance, given a graph G: can some properties of the strong resolving graph of G be deduced? or; can we realize every graph H as the strong resolving graph of another graph H ? These ones and several other questions were dealt with in [9], which was the first work paying specific attention to the strong resolving graphs of graphs as a special graph transformation. See also [10], where an open problem from [9] was settled.
Clearly, and as we will further notice, a good knowledge of the strong resolving graph of a graph brings important contributions to studying the strong metric dimension of graphs. In this sense, this work is precisely aimed to study the strong resolving graphs and the strong metric dimension of cactus graphs, with some emphasis on different special structures of such cactus graphs. As one will also note through our exposition, strong resolving graphs are very challenging for those graphs having a large number of induced cycles. Thus, cactus graphs represent a significant example of such a situation. With this work, we also contribute to some open problems presented in [9].
The study of the strong metric dimension of some classes of cactus graphs was started in [11,12] where the authors presented some general results for the strong metric dimension of corona product graph and rooted product graphs, respectively. Clear definitions of these two graph products can be found in [8]. A corona product graph or a rooted product graph can have the structure of a cactus graph, depending on which are the graphs used as factors in the product. For instance, if G is a cycle and H is a graph whose components are only singleton vertices or complete graphs K 2 , then it happens that the corona product graph G H is a cactus graphs. To generate a rooted product graph that is a cactus graph, we may consider for example two graphs G and H which are paths or cycles.
On the other hand, we must mention that the strong metric dimension of unicyclic graphs (which is a cactus graph too) was studied in [13]. There, among other results, several relationships between the strong metric dimension of a unicyclic graph and that of its complement were given. A few other sporadic results can be found in some other articles dealing with related topics that could include examples of cactus graphs. However, we prefer to not include more references that are not essentially connected with this article.
We hence now begin to formalize all the required notations and terminologies that shall be used throughout the document. To this end, for the whole exposition, let G be a connected simple graph with vertex set V(G). For two adjacent vertices x, y ∈ V(G), we use the notation x ∼ y. For a vertex x of G, N G (x) denotes the set of neighbors that x has in G, i.e., y) is the length of a shortest path between x and y (a shortest x, y path). Two vertices x, y are called diametral if d G (x, y) = D(G). For a set S ⊂ V(G), by S we represent the subgraph induced by S in G.

Strong Metric Dimension of Graphs
For two distinct vertices u, v ∈ V(G), a vertex w ∈ V(G) strongly resolves u, v if there is a shortest u, w path containing v, or a shortest v, w path containing u. Note that it could happen w ∈ {u, v}. A set S of vertices of G is a strong resolving set for G, if every two vertices of G are strongly resolved by some vertex of S. The smallest cardinality among all strong resolving sets for G is called the strong metric dimension of G, and is denoted by dim s (G). We say that a strong resolving set for G of cardinality dim s (G) is a strong metric basis of G. It next appears the value of the strong metric dimension of some basic graphs. Observation 1. Let G be a connected graph G of order n ≥ 2.
(e) If G is a tree with l leaves, dim s (G) = l − 1.
It is said that a vertex u of G is maximally distant from v if for every w ∈ N G (u), it happens d G (v, w) ≤ d G (u, v). If u is maximally distant from v and v is maximally distant from u, then u and v are mutually maximally distant, and we write that u, v are MMD in G. The set of MMD vertices of G is denoted by ∂(G). Note that the set of MMD vertices of a graph G is also known as the boundary of G, as defined in [14,15]. An explanation on the equivalence of these two objects can be readily observed, but also found in [16]. From these definitions, the following remarks are straightforward to observe. Remark 1. Let G be a connected graph. Then every two vertices with degree 1 are MMD in G.
For any two mutually maximally distant vertices in G, there is no vertex of G that strongly resolves them, except themselves. This allows to claim the following.

Remark 2.
For every pair of mutually maximally distant vertices x, y of a connected graph G, and for every strong metric basis S of G, it follows that x ∈ S or y ∈ S.

Strong Resolving Graph of a Graph
Given a connected graph G, the strong resolving graph of G, denoted by G SR , has vertex set ∂(G) and two vertices u, v are adjacent if and only if u and v are MMD in G. We must remark that the strong resolving graph of a graph G was defined in [7] as the graph with vertex set V(G) and two vertices u, v are adjacent if and only if u and v are MMD in G. Observe that the difference between these two definitions is the existence of isolated vertices in the strong resolving graph from [7]. The main reason of using in this work the slightly different version is to have a simpler notation and more clarity while proving the results. Moreover, this fact does not influence on the computations we made.
For several basic families of graphs, describing their strong resolving graphs is a straightforward problem. We next recall some examples, which will maybe further useful, and to this end, we recall that a vertex v of a graph G is simplicial, if its closed neighborhood induces a complete graph, and also that a graph G is 2-antipodal if every vertex of G is diametral with exactly one other vertex of G.

Observation 2.
(a) If ∂(G) equals the set of simplicial vertices of G, then G SR ∼ = K |∂(G)| . In particular, (K n ) SR ∼ = K n and for any tree T, T SR ∼ = K l(T) .
In [9], realization and characterization problems of the strong resolving graph of a graph as a graph transformation were firstly dealt with. That is, the following problems were studied.

•
Realization Problem. Determine which graphs have a given graph as their strong resolving graphs. • Characterization Problem. Characterize those graphs that are strong resolving graphs of some graphs.
For instance, in [9] was proved that complete graphs, paths and cycles of order larger than four are realizable as the strong resolving graph of other graphs. On the other hand, it was also proved in [9] that stars and cycles of order four are not realizable as strong resolving graphs. Based on these two facts, a conjecture concerning the not realization of complete bipartite graphs in general was pointed out. Such conjecture was recently shown in [10].
In connection with these comments, it would be desirable to continue obtaining some realization (and also characterization -although much more complicated) results for the strong resolving graphs of graphs. We are then aimed in this work to present some realization results which are involving cactus graphs.

Strong Metric Dimension of G versus Vertex Cover Number of G SR
Oellermann and Peters-Fransen [7] showed that the problem of finding the strong metric dimension of graphs can be transformed into the well-known problem regarding the vertex cover of graphs. A set S of vertices of G is a vertex cover of G if every edge of G is incident with at least one vertex of S. The vertex cover number of G, denoted by β(G), is the smallest cardinality of a vertex cover of G. We refer to a β(G)-set in a graph G as a vertex cover set of cardinality β(G).
Recall that the largest cardinality of a set of vertices of G, no two of which are adjacent, is called the independence number of G and is denoted by α(G). We refer to an α(G)-set in a graph G as an independent set of cardinality α(G). The following well-known and useful result, due to Gallai, states the relationship between the independence number and the vertex cover number of a graph.

Theorem 2 (Gallai's theorem).
For any graph G of order n, Thus, by using Theorems 1 and 2 we immediately obtain the next result.

Cactus Graphs: General Issues
A cactus graph (also called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently, every edge of the graph belongs to at most one simple cycle. Next we study the strong metric dimension of cactus graphs, and we first give some necessary terminology. Note that a cycle of two vertices is precisely a path on two vertices. A vertex belonging to at least two simple cycles is a cut vertex. A cycle having only one cut vertex is called a terminal cycle. In a terminal cycle A, every vertex being diametral, in the subgraph induced by A, with respect to the cut vertex of A is a terminal vertex. From now on, τ(G) denotes the set of terminal vertices of G. Also, ς 2 (G) denotes the set of vertices v, of degree two, belonging to a cycle of order larger than two, being MMD only with vertices of the same cycle which v belongs. Moreover, ι 2 (G) denotes the set of vertices u, of degree two, belonging to a cycle of order larger than two being MMD with at least one vertex of a different cycle which u belongs. The following remark can be easily observed.

Corollary 2. For any cactus graph
Theorem 3. Let G be a cactus graph. Then Proof. The lower bound follows from the following facts. Any two terminal vertices of G are MMD on G, and thus, they induce a complete graph of order |τ(G)|. Also, vertices of ς 2 (G) induce at least a graph with |ς 2 (G)| 2 independent edges that need to be covered in G SR . Thus, one needs at least to strongly resolve all the vertices of G.
To see the upper bound, it is only necessary to observe that the set τ(G) ∪ ι 2 (G) together with half of vertices of the set ς 2 (G) form a strong resolving set of G, and so, we are done.
Despite the fact that the bounds above are easily proved, we might notice that the problem of describing the strong resolving graph, and similarly, of computing the strong metric dimension of cactus graphs seems to be very challenging based on the situation that we can not control things like the orders of the involved cycles, the number of terminal vertices and cut vertices, their adjacencies, etc. In this sense, it is desirable to introduce extra conditions on the cactus graphs to have more possibilities to give some practical results.

Strong Resolving Graphs
In this section we aim to describe the structure of the strong resolving graphs of several different families of cactus graphs. We specifically center our attention into unicyclic graphs, bouquet of cycles and chains of even cycles. With some of these results we contribute to the problem of realization of some graphs as strong resolving graphs, that is, to the problems previously presented.

Unicyclic Graphs
Given a unicyclic graph G different from a cycle, from now on we will denote by is the set of terminal vertices of G. Note that the terminal vertices defined here represent a particular case of the terminal vertices defined for cactus graphs in general. If the vertex v i of C r has degree greater than two, then we say that The set of terminal vertices of a vertex v i is denoted by t(v i ). We will denote by c 2 (G) the set of vertices of the cycle C r having degree two. If v ∈ c 2 (G), then we will say that t(v) = ∅.
Notice that if the unicyclic graph G is isomorphic to the cycle C n , then for n even (C n ) SR ∼ = n 2 i=1 K 2 and for n odd (C n ) SR ∼ = C n as already presented in Observation 2. Thus, we will study the cases that G ∼ = C n .
We begin with the following straightforward observations that are useful to describe the strong resolving graph of any unicyclic graph.

Remark 4.
Let G be a unicyclic graph. For every vertex x ∈ c 2 (G) there exists at least one vertex y ∈ c 2 (G) ∪ T(G) such that x, y are MMD in G.  Notice that every two vertices x, y ∈ T(G) are MMD. Also, every vertex v ∈ c 2 (G) is MMD with every vertex w satisfying one of the following conditions.
• w is a terminal vertex of a vertex u of C r such that u, v are diametral vertices in C r . • w is a diametral vertex with v in C r and w ∈ c 2 (G).
As a consequence of the above comments, we can deduce the structure of the strong resolving graph of any unicyclic graph G in the following way. First notice that, according to Corollary 3, G SR has vertex set equal to c 2 (G) ∪ T(G), and to describe the adjacency of vertices in G SR we consider two cases.
G SR for r even.

•
The set T(G) forms a clique in G SR and each vertex of T(G) has at most one neighbor in c 2 (G). • If x, y ∈ c 2 (G) are diametral vertices in C r , then {x, y} is a connected component of G SR isomorphic to K 2 .
• If x, y are diametral vertices in C r , x ∈ c 2 (G) and y / ∈ c 2 (G), then {x} ∪ t(y) forms a subgraph of G SR isomorphic to K |t(y)|+1 and N G SR (x) = t(y).
G SR for r odd.

•
The set T(G) forms a clique in G SR and each vertex of T(G) has at most two neighbors in c 2 (G). • Let u ∈ c 2 (G) and let x, y being diametral vertices with u in C r . - -If x ∈ c 2 (G) and y / ∈ c 2 (G), then the set {u, x} ∪ t(y) form a subgraph (not induced) (Notice that the vertices t(y) are adjacent between them in G SR .) of G SR isomorphic to a star graph S 1,|t(y)|+1 with central vertex u, N G SR (u) = {x} ∪ t(y), δ G SR (x) ≥ 2 and for every w ∈ t(y), Similarly to the case when r is even, we can observe here that β(G SR ) ≤ |c 2 (G)| 2 + |T(G)|.
We define the branch restricted unicyclic graph T (G) associated to a unicyclic graph G in the following way. We begin with taking the cycle C r in G and removing the remaining vertices of G. Then we add t(v i ) pendant edges to every vertex v i in C r . Figure 1 shows an example of a unicyclic graph, its branch restricted unicyclic graph and its strong resolving graph. Figure 1. A unicyclic graph G, T (G) and G SR .

Lemma 1. Let G be a unicyclic graph and T (G) be its branch restricted unicyclic graph. Then (T (G)) SR is isomorphic to G SR
Proof. From Remarks 4 and 5, and by the definition of the branch restricted unicyclic graph, we deduce that (T (G)) SR is isomorphic to G SR .
Our next step is dedicated to present a realization result for some corona product graphs, where the solution precisely involves the use of unicyclic graphs. We first recall that the corona product graph G H is defined as the graph obtained from a graph G of order n and a graph H, by taking one copy of G and n copies of H, and then joining by an edge each vertex from the i th -copy of H with the i th -vertex of G.

Proposition 1.
For any integer n ≥ 3, there exists a graph G such that G SR ∼ = K n K 1 .

Proof.
We consider the unicyclic graph G with a cycle C 2n = v 1 v 2 . . . v 2n v 1 such that the vertices v 1 , v 2 , . . . , v n form the set c 2 (G) and the remaining ones from the cycle have exactly one terminal vertex. Since 2n is an even number according to the Description of G SR it clearly follows that G SR is isomorphic to K |T(G)| where each vertex of T(G) has exactly one neighbor in c 2 (G).

Bouquet of Cycles
Let B a,b,c be a family of graphs obtained in the following way. Each graph B ∈ B a,b,c is a bouquet of a + b + c cycles where a of them are even cycles (of order at least four), b are odd cycles of order larger than three, c are cycles of order three, a, b, c ≥ 0, and a + b + c ≥ 2. All cycles of B ∈ B a,b,c have the common vertex w. One example of a bouquet of cycles is given in Figure 2. Let C r 1 , C r 2 , . . . , C r a be the even cycles of order at least four in B ∈ B a,b,c and C s 1 , C s 2 , . . . , C s b be the odd cycles of order larger than three in B ∈ B a,b,c . In [17], the authors have described the structure of the strong resolving graph of the graph B ∈ B a,b,c as follows. By completeness of our exposition, we copy exactly the description presented there, since it makes no sense to do some changes on it, as it is fairly well written.

•
The set of a vertices of the cycles C r 1 , C r 2 , . . . , C r a which are diametral with w induces a complete graph in B SR . We denote such set as V a (in Figures 2 and 3, the black colored vertices).

•
The set of 2b vertices of the cycles C s 1 , C s 2 , . . . , C s b which are diametral with w induces a complete multipartite graph K 2,...,2 with b bipartition sets each of cardinality two in B SR . We denote such set as V 2b (in Figures 2 and 3, the red colored vertices).

•
The set of 2c vertices of the cycles C 3 different from w induces a complete graph in B SR . We denote such set as V 2c (in Figures 2 and 3, the blue colored vertices).

•
The set of vertices of each odd cycle C s i , i ∈ {1, . . . , b}, which are different from w induces a path of order s i − 1, in B SR , whose leaves are the two vertices that are diametral with w.

•
The set of vertices of each cycle C r j , j ∈ {1, . . . , a}, which are not diametral with w induces a graph isomorphic to the disjoint union of (r j − 2)/2 complete graphs K 2 in B SR . • Every three vertices x, y, z such that x ∈ V a , y ∈ V 2b and z ∈ V 2c are pairwise adjacent. Figure 3 shows the strong resolving graph of the graph illustrated in Figure 2. If we study the bouquet of cycles B ∈ B a,b,c with b = 0 (or equivalently, B has not odd cycles of order larger than three), and C r 1 , C r 2 , . . . , C r a are the cycles of even order, then the strong resolving graph B SR is composed by the complete graph K a+2c and ∑ a i=1 r i −2 Now, we again give some realization results for strong resolving graphs. To this end, we need to define a graph structure which we call a partial multisubdivided complete graph K 2n (p 1 , p 2 , . . . , p n ). That is, a complete graph K 2n where each edge of a perfect matching of this graph is subdivided p i ≥ 0 times for i ∈ {1, 2, ..., n} (the case when some p i = 0 means that the edge corresponding to p i is not subdivided). Moreover, recall that the cocktail party graph R n , also called the hyperoctahedral graph, is a n − 2 regular graph on n vertices.

Proposition 2.
For any integer n ≥ 2, there exists a graph G such that G SR is isomorphic to K 2n (p 1 , p 2 , . . . , p n ).
Proof. We consider the bouquet of cycles B ∈ B a,b,c with a, c = 0, b = n and C p 1 +3 , C p 2 +3 , . . . , C p n +3 are the cycles of odd order larger than three. According to the construction of the strong resolving graph B SR , the subgraph V b is isomorphic to R 2n and the set of vertices of each odd cycle C p i +3 , i ∈ {1, . . . , b}, which are different from w induces a path of order p i + 2, in B SR , whose leaves are the two vertices of this cycle that are not adjacent in R 2n .

Corollary 4.
For any integer n ≥ 2, there exists a graph G such that G SR contains the cocktail party graph R 2n as an induced subgraph.

Chains of Even Cycles
A chain of cycles is a cactus graph in which, every cycle has order at least three and there are only two terminal cycles. Notice that in such case every non-terminal cycle has exactly two cut vertices, such that each cut vertex belongs to exactly two cycles. We next center our attention into the case of chains of even cycles. To this end, we need some terminology and notation. A chain of even cycles is a straight chain, if the cut vertices of every cycle in the chain are diametral in the cycle. Note that each straight chain contains two diametral vertices, which are the unique terminal vertices of this chain.
For the purposes of simplifying, given an integer k ≥ 0, we shall define the next family F k of graphs. Each graph F ∈ F k is a chain of even cycles constructed as follows.

•
We begin with k + 1 straight chains of even cycles, say G 0 , . . . , G k , satisfying that the last cycle of the straight chain G i is isomorphic to the first cycle of the straight chain G i+1 for every i ∈ {0, . . . , k − 1}. • Assume that the last cycle of each straight chain G i is C i r = v i 0 v i 1 · · · v i r−1 v i 0 , for every i ∈ {0, . . . , k}. By the item above, this C i r (in G i ) is isomorphic to the first cycle of the straight chain G i+1 with i ∈ {0, . . . , k − 1}.
• Assume also that the terminal vertices of each straight chain G i are a i , b k−i , for every i ∈ {0, . . . , k}.

•
To construct our chain of even cycles F ∈ F k , for every i ∈ {0, . . . , k − 1}, we identify the last cycle C i r of G i with the first cycle C i+1 r of G i+1 (that are isomorphic) as follows. Every vertex v i j of C i r is identified with the vertex v i+1 j+t for some t = 0 and every j ∈ {0, r − 1} (operations with the subindex of v are done modulo r).
Notice that for instance, for the chain of even cycles F ∈ F k described above, the two terminal vertices of it are a 0 and b 0 . Figure 4 shows a fairly representative example of a chain of even cycles. Recall that the way of drawing such graph (with respect to directions of the "turns" in the chain) does not influence in our purposes. The chain of even cycles F ∈ F k presented in the Figure 4 has four straight chains of even cycles: G 0 contains C 1 and C 2 , G 1 contains C 2 , C 3 and C 4 , G 2 contains C 4 , C 5 and C 6 , and G 3 contains C 6 , C 7 and C 8 . Figure 4. A chain of cycles F ∈ F 3 containing six cycles C 4 and two cycles C 6 .
We next describe the strong resolving graph of a chain of even cycles F ∈ F k . We need first the following observations. Remark 6. For any chain of even cycles F ∈ F k , a vertex x belongs to ∂(F) if and only if x has degree two.

Remark 7.
In a straight chain of cycles, the two terminal vertices form a pair of MMD vertices, as well as each pair of diametral vertices in each cycle.

•
The terminal vertex a i of the straight chain G i is MMD with every vertex b k−j of the straight chain G j .

•
The terminal vertex b i of the straight chain G k−i is MMD with every vertex a k−j of the straight chain G k−j .
• In any cycle of F, any pair of diametral (in the cycle) vertices being not cut nor terminal vertices of F are MMD.
For instance, in Figure 4, the red vertex a 1 is MMD with the blue vertices b 2 , b 1 , b 0 , while the blue vertex b 1 is MMD with the red vertices a 2 , a 1 , a 0 . Moreover, again in Figure 4, any pair of green diametral vertices belonging to the same cycle are MMD in F.
With these observations above, we are able to describe the structure of F SR for every chain of even cycles F ∈ F k . To do so, we shall need the following construction, which represents a bipartite graph J r of order 2r + 2 for some r ≥ 3. The two bipartition sets of the bipartite graph J r are the sets U = {a 0 , . . . , a r } and V = {b 0 , . . . , b r }. The edges of J r are as follows. For every i ∈ {0, . . . , r/2 } and every j ∈ {0, . . . , r − i}, there exist the edges a i b j and b i a j .

•
The set of vertices a i and b i , with i ∈ {0, . . . , k}, forms a component of the graph F SR isomorphic to a bipartite graph J k .

•
In each cycle of F, each pair of diametral vertices in the cycle, not including terminal nor cut vertices, induces a graph isomorphic to K 2 in F SR .
We may remark that, the strong resolving graph of a straight chain of cycles is simply a union of several complete graphs K 2 . The strong resolving graph of the chain of even cycles shown in Figure 4 is drawn in Figure 5. We end this subsection by giving a realization result for strong resolving graphs involving chains of even cycles.

Corollary 5.
For any integer k ≥ 2, there exists a chain of even cycles F ∈ F k such that F SR contains the bipartite graph J k as a component.

The Strong Metric Dimension
We are next centered into computing or bounding the strong metric dimension of the cactus graphs which we have studied in the previous section.

Unicyclic Graphs
Our first results shows the relationship between the strong metric dimension of a unicyclic graph and that of its branch restricted unicyclic graph.

Lemma 2.
Let G be a unicyclic graph and T (G) be its branch restricted unicyclic graph. Then dim s (G) = dim s (T (G)).
Theorem 4. Let G be a unicyclic graph with unique cycle C r . Then Proof. From Remark 1 we have that every strong resolving basis must contain at least |T(G)| − 1 vertices of degree one. So, dim s (G) ≥ |T(G)| − 1. On the other hand, for every vertex i ∈ {1, . . . , r} there exists at least a vertex w i ∈ t(v i ) ∪ {v i } such that w i ∈ ∂(G) (notice that it could happen w i = v i ).
Thus we have that dim s (G) = β(G SR ) ≥ |∂(G)| 2 ≥ r 2 . On the other side, since T(G) forms a clique in G SR and for every u ∈ c 2 (G) there exists at least one vertex v ∈ ∂(G) such that they are MMD, according to the description of G SR presented in the previous section, we have dim s (G) = β(G SR ) ≤ |T(G)| + |c 2 (G)| 2 . Therefore the proof is complete.
As we can see in the following, the bounds above are tight. In particular, we characterize all the unicyclic graphs having a unique cycle of even order that are attaining the upper bound. Proof. (⇐) We assume |c 2 (G)| = r − 1. Let v be the only vertex of C r with degree greater than two, and let u be the diametral vertex with v in C r . So, every two vertices in t(v) ∪ {u} are MMD. Also, every two diametral vertices in c 2 (G) − {u} are MMD. Thus, G SR is formed by r−2 2 = |c 2 (G)|−1 2 connected components isomorphic to K 2 and one component isomorphic to K |t(v)|+1 . Since T(G) = t(v), we have that To conclude this section, we next show that the differences between the lower (partially) and upper bounds of Theorem 4, and the real value of the strong metric dimension of some unicyclic graphs can be as large as possible.
We consider the unicyclic graph G k with a cycle C 2n = v 1 v 2 · · · v 2n v 1 and 1 ≤ k ≤ n such that the vertices v k+1 , v k+2 , . . . , v 2n form the set c 2 (G), and each vertex v i for i ∈ {1, . . . , k} has one terminal vertex denoted by x i . Since 2n is an even number, and according to the description of the strong resolving graph of a unicyclic graph, it clearly follows that (G k ) SR consists of a graph isomorphic to K |T(G)| K 1 and |c 2 (G)|−k 2 graphs isomorphic to K 2 . Thus, dim s (G k ) = |T(G)| + |c 2 (G)|−k 2 . Since 1 ≤ k ≤ |c 2 (G)|, we can easily observe that |T(G)| + |c 2 (G)| 2 − dim s (G k ) and dim s (G k ) − (|T(G)| − 1) can be arbitrarily large.

Bouquet of Cycles
For the results of this subsection, we use the terminology and notations given in Section 3.2.
Proof. According to the description of B SR presented before, it follows that B SR consist of a graph isomorphic to K a+2b+2c (s 1 − 3, s 2 − 3, . . . , s b − 3, 0, 0, . . . , 0) and ∑ a i=1 r i −2 2 graphs isomorphic to K 2 . First we consider the subgraph H induced by In order to compute β(K a+2b+2c (s 1 − 3, s 2 − 3, . . . , s b − 3, 0, 0, . . . , 0)) we need to cover the remaining edges in B SR corresponding to edges of the odd cycles in B. Since for each odd cycle C s i for i ∈ {1, . . . , b}, two edges of it are already considered in H, it remains to cover s i − 4 edges which are inducing a path of order s i − 3. Thus, to cover each cycle C s i we need s i −3 2 vertices. On the other hand, to cover the ∑ a i=1 r i −2 2 graphs isomorphic to K 2 , ∑ a i=1 r i −2 2 extra vertices are needed. The sum of these three quantities above gives the vertex cover number of B SR , and also the strong metric dimension of B, by using Corollary 1, which completes the proof.

Chains of Even Cycles
In order to give a formula for the strong metric dimension of chains of even cycles, we need to first compute the value of the vertex cover number of a bipartite graph J r as described in Section 3.3.
Thus, since J r is bipartite, by using the famous Kőnig's Theorem, we obtain the required result.
Theorem 7. For any chain of even cycles F ∈ F k of order n with c cut vertices, dim s (F) = n − c 2 .
Proof. According to the description of F SR presented before, the vertices a i and b i , with i ∈ {0, . . . , k}, forms a component of the graph F SR isomorphic to a bipartite graph J k of order 2k + 2. For completing the graph F SR , we need to add n−c−2k−2 2 graphs isomorphic to K 2 . Hence, by using Theorem 1, Lemma 3 and Observation 1, we have dim s (F) = β(J k ) + n−c−2k−2 2 β(K 2 ) = n−c 2 .

Concluding Remarks
We have studied the strong metric dimension of cactus graphs in this work. Along the way, we have given several contributions to the realization and characterization results of strong resolving graphs involving cactus graphs. The results shown allow to observe that working in this topic for the specific case of cactus graphs is very challenging, although some particular structures of such graphs can be easier handled. These are the cases of unicyclic graphs, chains of even cycles and bouquet of cycles, for which we have given the constructions of their strong resolving graphs and bounds or closed formulas for the values of their strong metric dimensions. As a consequence of this study, the following open questions are raised.

•
Describe the structure of the strong resolving graphs of some classes of cactus graphs, and compute the strong metric dimension of the graphs in such families.

•
Apply the results concerning the descriptions of the strong resolving graphs of the graphs given in the work to other problems, like for instance computing the strong partition dimension (see [4]) of such graphs.

•
Continue the lines of this study for other more general families that cactus graphs. This could include for instance, planar graphs or chordal graphs.