Next Article in Journal / Special Issue
Gromov Hyperbolicity in Mycielskian Graphs
Previous Article in Journal

Symmetry 2017, 9(8), 132; https://doi.org/10.3390/sym9080132

Article
The Simultaneous Local Metric Dimension of Graph Families
by Gabriel A. Barragán-Ramírez 1, Alejandro Estrada-Moreno 1, Yunior Ramírez-Cruz 2,* and Juan A. Rodríguez-Velázquez 1
1
Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Av. Països Catalans 26, 43007 Tarragona, Spain
2
Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, 6 av. de la Fonte, L-4364 Esch-sur-Alzette, Luxembourg
*
Author to whom correspondence should be addressed.
Received: 10 May 2017 / Accepted: 24 July 2017 / Published: 27 July 2017

## Abstract

:
In a graph $G = ( V , E )$, a vertex $v ∈ V$ is said to distinguish two vertices x and y if $d G ( v , x ) ≠ d G ( v , y )$. A set $S ⊆ V$ is said to be a local metric generator for G if any pair of adjacent vertices of G is distinguished by some element of S. A minimum local metric generator is called a local metric basis and its cardinality the local metric dimension of G. A set $S ⊆ V$ is said to be a simultaneous local metric generator for a graph family $G = { G 1 , G 2 , … , G k }$, defined on a common vertex set, if it is a local metric generator for every graph of the family. A minimum simultaneous local metric generator is called a simultaneous local metric basis and its cardinality the simultaneous local metric dimension of $G$. We study the properties of simultaneous local metric generators and bases, obtain closed formulae or tight bounds for the simultaneous local metric dimension of several graph families and analyze the complexity of computing this parameter.
Keywords:
local metric dimension; simultaneity; corona product; lexicographic product; complexity

## 1. Introduction

A generator of a metric space is a set S of points in the space with the property that every point of the space is uniquely determined by its distances from the elements of S. Given a simple and connected graph $G = ( V , E )$, we consider the function $d G : V × V → N$, where $d G ( x , y )$ is the length of the shortest path between u and v and $N$ is the set of non-negative integers. Clearly, $( V , d G )$ is a metric space, i.e., $d G$ satisfies $d G ( x , x ) = 0$ for all $x ∈ V$, $d G ( x , y ) = d G ( y , x )$ for all $x , y ∈ V$ and $d G ( x , y ) ≤ d G ( x , z ) + d G ( z , y )$ for all $x , y , z ∈ V$. A vertex $v ∈ V$ is said to distinguish two vertices x and y if $d G ( v , x ) ≠ d G ( v , y )$. A set $S ⊆ V$ is said to be a metric generator for G if any pair of vertices of G is distinguished by some element of S.
Metric generators were introduced by Blumental  in the general context of metric spaces. They were later introduced in the context of graphs by Slater in , where metric generators were called locating sets, and, independently, by Harary and Melter in , where metric generators were called resolving sets. Applications of the metric dimension to the navigation of robots in networks are discussed in  and applications to chemistry in [5,6]. This invariant was studied further in a number of other papers including, for instance [7,8,9,10,11,12,13,14,15,16,17,18,19,20].
As pointed out by Okamoto et al. in , there exist applications where only neighboring vertices need to be distinguished. Such applications were the basis for the introduction of the local metric dimension. A set $S ⊆ V$ is said to be a local metric generator for G if any pair of adjacent vertices of G is distinguished by some element of S. A minimum local metric generator is called a local metric basis and its cardinality the local metric dimension of G, denoted by $dim l ( G )$. Additionally, Jannesari and Omoomi  introduced the concept of adjacency resolving sets as a result of considering the two-distance in $V ( G )$, which is defined as $d G , 2 ( u , v ) = min { d G ( u , v ) , 2 }$ for any two vertices $u , v ∈ V ( G )$. A set of vertices $S ′$ such that any pair of vertices of $V ( G )$ is distinguished by an element s in $S ′$ considering the two-distance in $V ( G )$ is called an adjacency generator for G. If we only ask $S ′$ to distinguish the pairs of adjacent vertices, we call $S ′$ a local adjacency generator. A minimum local adjacency generator is called a local adjacency basis, and the cardinality of any such basis is the local adjacency dimension of G, denoted $adim l ( G )$.
The notion of simultaneous metric dimension was introduced in the framework of the navigation problem proposed in , where navigation was studied in a graph-structured framework in which the navigating agent (which was assumed to be a point robot) moves from node to node of a “graph space”. The robot can locate itself by the presence of distinctively-labeled “landmark” nodes in the graph space. On a graph, there is neither the concept of direction, nor that of visibility. Instead, it was assumed in  that a robot navigating on a graph can sense the distances to a set of landmarks. Evidently, if the robot knows its distances to a sufficiently large set of landmarks, its position on the graph is uniquely determined. This suggests the following problem: given a graph G, what are the fewest number of landmarks needed and where should they be located, so that the distances to the landmarks uniquely determine the robot’s position on G? Indeed, the problem consists of determining the metric dimension and a metric basis of G. Now, consider the following extension of this problem, introduced by Ramírez-Cruz, Oellermann and Rodríguez-Velázquez in . Suppose that the topology of the navigation network may change within a range of possible graphs, say $G 1 , G 2 , … , G k$. This scenario may reflect several situations, for instance the simultaneous use of technologically-differentiated redundant sets of landmarks, the use of a dynamic network whose links change over time, etc. In this case, the above-mentioned problem becomes determining the minimum cardinality of a set S, which must be simultaneously a metric generator for each graph $G i$, $i ∈ { 1 , … , k }$. Therefore, if S is a solution for this problem, then each robot can be uniquely determined by the distance to the elements of S, regardless of the graph $G i$ that models the network at each moment. Such sets we called simultaneous metric generators in , where, by analogy, a simultaneous metric basis was defined as a simultaneous metric generator of minimum cardinality, and this cardinality was called the simultaneous metric dimension of the graph family $G$, denoted by $Sd ( G )$.
In this paper, we recover Okamoto et al.’s observation that in some applications, it is only necessary to distinguish neighboring vertices. In particular, we consider the problem of distinguishing neighboring vertices in a multiple topology scenario, so we deal with the problem of finding the minimum cardinality of a set S, which must simultaneously be a local metric generator for each graph $G i$, $i ∈ { 1 , … , k }$.
Given a family $G = { G 1 , G 2 , … , G k }$ of connected graphs $G i = ( V , E i )$ on a common vertex set V, we define a simultaneous local metric generator for $G$ as a set $S ⊆ V$ such that S is simultaneously a local metric generator for each $G i$. We say that a minimum simultaneous local metric generator for $G$ is a simultaneous local metric basis of $G$ and its cardinality the simultaneous local metric dimension of $G$, denoted by $Sd l ( G )$ or explicitly by $Sd l ( G 1 , G 2 , … , G k )$. An example is shown in Figure 1, where the set ${ v 3 , v 4 }$ is a simultaneous local metric basis of ${ G 1 , G 2 , G 3 }$.
It will also be useful to define the simultaneous local adjacency dimension of a family $G = { G 1 , G 2 , ⋯ , G k }$ of connected graphs $G i = ( V , E i )$ on a common vertex set V, as the cardinality of a minimum set $S ⊆ V$ such that S is simultaneously a local adjacency generator for each $G i$. We denote this parameter as $Sad l G$.
In what follows, we will use the notation $K n$, $K r , s$, $C n$, $N n$ and $P n$ for complete graphs, complete bipartite graphs, cycle graphs, empty graphs and path graphs of order n, respectively. Given a graph $G = ( V , E )$ and a vertex $v ∈ V ,$ the set $N G ( v ) = { u ∈ V : u ∼ v }$ is the open neighborhood of v, and the set $N G [ v ] = N G ( v ) ∪ { v }$ is the closed neighborhood of v. Two vertices $x , y ∈ V ( G )$ are true twins in G if $N G [ x ] = N G [ y ]$, and they are false twins if $N G ( x ) = N G ( y )$. In general, two vertices are said to be twins if they are true twins or they are false twins. As usual, a set $A ⊆ V ( G )$ is a vertex cover for G if for every $u v ∈ E ( G )$, $u ∈ A$ or $v ∈ A$. The vertex cover number of G, denoted by $β ( G )$, is the minimum cardinality of a vertex cover of G. The remaining definitions will be given the first time that the concept appears in the text.
The rest of the article is organized as follows. In Section 2, we obtain some general results on the simultaneous local metric dimension of graph families. Section 3 is devoted to the case of graph families obtained by small changes on a graph, while in Section 4 and Section 5, we study the particular cases of families of corona graphs and families of lexicographic product graphs, respectively. Finally, in Section 6, we show that the problem of computing the simultaneous local metric dimension of graph families is NP-hard, even when restricted to families of graphs that individually have a (small) fixed local metric dimension.

## 2. Basic Results

Remark 1.
Let $G = { G 1 , ⋯ , G k }$ be a family of connected graphs defined on a common vertex set V, and let $G ′ = ( V , ∪ E ( G i ) )$. The following results hold:
1.
$Sd l ( G ) ≥ max i ∈ { 1 , ⋯ , k } { dim l ( G i ) }$.
2.
$Sd l ( G ) ≤ Sd ( G )$.
3.
$Sd l ( G ) ≤ min β ( G ′ ) , ∑ i = 1 k dim l ( G i )$.
Proof.
(1) is deduced directly from the definition of simultaneous local metric dimension. Let B be a simultaneous metric basis of $G$, and let $u , v ∈ V − B$ be two vertices not in B, such that $u ∼ G i v$ in some $G i$. Since in $G i$ there exists $x ∈ B$ such that $d G i ( u , x ) ≠ d G i ( v , x )$, B is a simultaneous local metric generator for $G$, so (2) holds. Finally, (3) is obtained from the following facts: (a) the union of local metric generators for all graphs in $G$ is a simultaneous local metric generator for $G$, which implies that $Sd l ( G ) ≤ ∑ i = 1 k dim l ( G i )$; (b) any vertex cover of $G ′$ is a local metric generator of $G i$, for every $G i ∈ G$, which implies that $Sd l ( G ) ≤ β ( G ′ )$. ☐
The inequalities above are tight. For example, the graph family $G$ shown in Figure 1 satisfies $Sd l ( G ) = Sd ( G )$, whereas $Sd l ( G ) = 2 = dim l ( G 1 ) = dim l ( G 2 ) = max i ∈ { 1 , 2 , 3 } { dim l ( G i ) }$. Moreover, the family $G$ shown in Figure 2 satisfies $Sd l ( G ) = 3 = | V | − 1 < ∑ i = 1 6 dim l ( G i ) = 12$, whereas the family $G = { G 1 , G 2 }$ shown in Figure 3 satisfies $Sd l ( G ) = 4 = dim l ( G 1 ) + dim l ( G 2 ) < | V | − 1 = 7$.
We now analyze the extreme cases of the bounds given in Remark 1.
Corollary 1.
Let $G$ be a family of connected graphs on a common vertex set. If $K n ∈ G$, then:
$Sd l ( G ) = n − 1 .$
As shown in Figure 2, the converse of Corollary 1 does not hold. In general, the cases for which the upper bound $Sd l ( G ) ≤ | V | − 1$ is reached are summarized in the next result.
Theorem 1.
Let $G$ be a family of connected graphs on a common vertex set V. Then, $Sd l ( G ) = | V | − 1$ if and only if for every $u , v ∈ V$, there exists a graph $G u v ∈ G$ such that u and v are true twins in $G u v$.
Proof.
We first note that for any connected graph $G = ( V , E )$ and any vertex $v ∈ V$, it holds that $V − { v }$ is a local metric generator for G. Therefore, if $Sd l ( G ) = | V | − 1$, then for any $v ∈ V$, the set $V − { v }$ is a simultaneous local metric basis of $G$, and as a consequence, for every $u ∈ V − { v }$, there exists a graph $G u v ∈ G$, such that the set $V − { u , v }$ is not a local metric generator for $G u v$, i.e., u and v are adjacent in $G u v$ and $d G u , v ( u , x ) = d G u , v ( v , x )$ for every $x ∈ V − { u , v }$. Therefore, u and v are true twins in $G u , v$.
Conversely, if for every $u , v ∈ V$ there exists a graph $G u v ∈ G$ such that u and v are true twins in $G u v$, then for any simultaneous local metric basis B of $G$, it holds that $u ∈ B$ or $v ∈ B$. Hence, all but one element of V must belong to B. Therefore, $| B | ≥ | V | − 1$, which implies that $Sd l G = | V | − 1$. ☐
Notice that Corollary 1 is obtained directly from the previous result. Now, the two following results concern the limit cases of Item (1) of Remark 1.
Theorem 2.
A family $G$ of connected graphs on a common vertex set V satisfies $Sd l ( G ) = 1$ if and only if every graph in $G$ is bipartite.
Proof.
If every graph in the family is bipartite, then for any $v ∈ V$, the set ${ v }$ is a local metric basis of every $G i ∈ G$, so $Sd l ( G ) = 1$.
Let us now consider a family $G$ of connected graphs on a common vertex set V such that $Sd l ( G ) = 1$ and assume that some $G ∈ G$ is not bipartite. It is shown in  that $dim l ( G ) ≥ 2$, so Item (1) of Remark 1 leads to $Sd l ( G ) ≥ 2$, which is a contradiction. Thus, every $G ∈ G$ is bipartite. ☐
Paths, trees and even-order cycles are bipartite. The following result covers the case of families composed of odd-order cycles.
Theorem 3.
Every family $G$ composed of cycle graphs on a common odd-sized vertex set V satisfies $Sd l ( G ) = 2$, and any pair of vertices of V is a simultaneous local metric basis of $G$.
Proof.
For any cycle $C i ∈ G$, the set ${ v }$, $v ∈ V$, is not a local metric generator, as the adjacent vertices $v j + | V | 2$ and $v j − | V | 2$ (subscripts taken modulo $| V |$) are not distinguished by v, so Item (1) of Remark 1 leads to $Sd l ( G ) ≥ max G ∈ G { dim l ( G ) } ≥ 2$. Moreover, any set ${ v , v ′ }$ is a local metric generator for every $C i ∈ G$, as the single pair of adjacent vertices not distinguished by v is distinguished by $v ′$, so that $Sd l ( G ) ≤ 2$. ☐
The following result allows us to study the simultaneous local metric dimension of a family $G$ from the family of graphs composed by all non-bipartite graphs belonging to $G$.
Theorem 4.
Let $G$ be a family of graphs on a common vertex set V, not all of them bipartite. If $H$ is the subfamily of $G$ composed of all non-bipartite graphs belonging to $G$, then:
$Sd l ( G ) = Sd l ( H ) .$
Proof.
Since $H$ is a non-empty subfamily of $G$, we conclude that $Sd l ( G ) ≥ Sd l ( H ) .$ Since any vertex of a bipartite graph G is a local metric generator for G, if $B ⊆ V$ is a simultaneous local metric basis of $H$, then B is a simultaneous local metric generator for $G$ and, as a result, $Sd l ( G ) ≤ | B | = Sd l ( H ) .$ ☐
Some interesting situations may be observed regarding the simultaneous local metric dimension of some graph families versus its standard counterpart. In particular, the fact that false twin vertices need not be distinguished in the local variant leads to some cases where both parameters differ greatly. For instance, consider any family $G$ composed of three or more star graphs having different centers. It was shown in  that any such family satisfies $Sd ( G ) = | V | − 1$, yet by Theorem 2, we have that $Sd l ( G ) = 1$.
Given a family $G = { G 1 , G 2 , ⋯ , G k }$ of graphs $G i = ( V , E i )$ on a common vertex set V, we define a simultaneous vertex cover of $G$ as a set $S ⊆ V$, such that S is simultaneously a vertex cover of each $G i$. The minimum cardinality among all simultaneous vertex covers of $G$ is the simultaneous vertex cover number of $G$, denoted by $β ( G )$.
Theorem 5.
For any family $G$ of connected graphs with common vertex set V,
$Sd l ( G ) ≤ β ( G ) .$
Furthermore, if for every $u v ∈ ∪ G ∈ G E ( G )$ there exists $G ′ ∈ G$ such that u and v are true twins in $G ′$, then $Sd l ( G ) = β ( G )$.
Proof.
Let $B ⊆ V$ be a simultaneous vertex cover of $G$. Since $V − B$ is a simultaneous independent set of $G$, we conclude that $Sd l ( G ) ≤ β ( G )$.
We now assume that for every $u v ∈ ∪ G ∈ G E ( G )$, there exists $G ′ ∈ G$, such that u and v are true twins in $G ′$, and suppose, for the purpose of contradiction, that $Sd l ( G ) < β ( G )$. In such a case, there exists a simultaneous local metric basis $C ⊆ V$, which is not a simultaneous vertex cover of $G$. Hence, there exist $u ′ , v ′ ∈ V − C$ and $G ∈ G$ such that $u ′ v ′ ∈ E ( G )$, ergo $u ′ v ′ ∈ ∪ G ∈ G E ( G )$. As a consequence, $u ′$ and $v ′$ are true twins in some graph $G ′ ∈ G$, which contradicts the fact that C is a simultaneous local metric basis of $G$. Therefore, the strict inequality does not hold, hence $Sd l ( G ) = β ( G )$. ☐

## 3. Families Obtained by Small Changes on a Graph

Consider a graph G whose local metric dimension is known. In this section, we address two related questions:
• If a series of small changes is repeatedly performed on $E ( G )$, thus producing a family $G$ of consecutive versions of G, what is the behavior of $Sd l ( G )$ with respect to $dim l ( G )$?
• If several small changes are performed on $E ( G )$ in parallel, thus producing a family $G$ of alternative versions of G, what is the behavior of $Sd l ( G )$ with respect to $dim l ( G )$?
Addressing this issue in the general case is hard, so we will analyze a number of particular cases. First, we will specify three operators that describe some types of changes that may be performed on a graph G:
• Edge addition: We say that a graph $G ′$ is obtained from a graph G by an edge addition if there is an edge $e ∈ E ( G ¯ )$ such that $G ′ = ( V ( G ) , E ( G ) ∪ { e } )$. We will use the notation $G ′ = add e ( G )$.
• Edge removal: We say that a graph $G ′$ is obtained from a graph G by an edge removal if there is an edge $e ∈ E ( G )$ such that $G ′ = ( V ( G ) , E ( G ) − { e } )$. We will use the notation $G ′ = rmv e ( G )$.
• Edge exchange: We say that a graph $G ′$ is obtained from a graph G by an edge exchange if there is an edge $e ∈ E ( G )$ and an edge $f ∈ E ( G ¯ )$ such that $G ′ = ( V ( G ) , ( E ( G ) − { e } ) ∪ { f } )$. We will use the notation $G ′ = xch e , f ( G )$.
Now, consider a graph G and an ordered k-tuple of operations $O k = ( op 1 , op 2 , … , op k )$, where $op i ∈ { add e i , rmv e i , xch e i , f i }$. We define the class $C O k ( G )$ containing all graph families of the form $G = { G , G 1 ′ , G 2 ′ , … , G k ′ }$, composed by connected graphs on the common vertex set $V ( G )$, where $G i ′ = op i ( G i − 1 ′ )$ for every $i ∈ { 1 , … , k }$. Likewise, we define the class $P O k ( G )$ containing all graph families of the form $G = { G 1 ′ , G 2 ′ , … , G k ′ }$, composed by connected graphs on the common vertex set $V ( G )$, where $G i ′ = op i ( G )$ for every $i ∈ { 1 , … , k }$. In particular, if $op i = add e i$ ($op i = rmv e i$, $op i = xch e i , f i$) for every $i ∈ { 1 , … , k }$, we will write $C A k ( G )$ ($C R k ( G )$, $C X k ( G )$) and $P A k ( G )$ ($P R k ( G )$, $P X k ( G )$).
We have that performing an edge exchange on any tree T (path graphs included) either produces another tree or a disconnected graph. Thus, the following result is a direct consequence of this fact and Theorem 2.
Remark 2.
For any tree T, any $k ≥ 1$ and any graph family $T ∈ C X k ( T ) ∪ P X k ( T )$,
$Sd l ( T ) = 1 .$
Our next result covers a large class of families composed by unicyclic graphs that can be obtained by adding edges, in parallel, to a path graph.
Remark 3.
For any path graph $P n$, $n ≥ 4$, any $k ≥ 1$ and any graph family $G ∈ P A k ( P n )$,
$1 ≤ Sd l ( G ) ≤ 2 .$
Proof.
Every graph $G ∈ G$ is either a cycle or a unicyclic graph. If the cycle subgraphs of every graph in the family have even order, then $Sd l ( G ) = 1$ by Theorem 2. If $G$ contains at least one non-bipartite graph, then $Sd l ( G ) ≥ 2$. We now proceed to show that in this case, $Sd l ( G ) ≤ 2$. To this end, we denote by $V = { v 1 , ⋯ , v n }$ the vertex set of $P n$, where $v i ∼ v i + 1$ for every $i ∈ { 1 , ⋯ , n − 1 }$. We claim that ${ v 1 , v n }$ is a simultaneous local metric generator for the subfamily $G ′ ⊂ G$ composed by all non-bipartite graphs of $G$. In order to prove this claim, consider an arbitrary graph $G ∈ G ′$, and let $e = v p v q$, $1 ≤ p < q ≤ n$ be the edge added to $E ( P n )$ to obtain G. We differentiate the following cases:
• $e = v 1 v n$. In this case, G is an odd-order cycle graph, so ${ v 1 , v n }$ is a local metric generator.
• $1 < p < q = n$. In this case, G is a unicyclic graph where $v p$ has degree three, $v 1$ has degree one and the remaining vertices have degree two. Consider two adjacent vertices $u , v ∈ V − { v 1 , v n }$. If u or v belong to the path from $v 1$ to $v p$, then $v 1$ distinguishes them. If both, u and v, belong to the cycle subgraph of G, then $d ( u , v 1 ) = d ( u , v p ) + d ( v p , v 1 )$ and $d ( v , v 1 ) = d ( v , v p ) + d ( v p , v 1 )$. Thus, if $v p$ distinguishes u and v, so does $v 1$, otherwise $v n$ does.
• $1 = p < q < n$. This case is analogous to Case 2.
• $1 < p < q < n$. In this case, G is a unicyclic graph where $v p$ and $v q$ have degree three, $v 1$ and $v n$ have degree one and the remaining vertices have degree two. Consider two adjacent vertices $u , v ∈ V − { v 1 , v n }$. If u or v belong to the path from $v 1$ to $v p$ (or to the path from $v q$ to $v n$), then $v 1$ (or $v n$) distinguishes them. If both u and v belong to the cycle, then $d ( u , v 1 ) = d ( u , v p ) + d ( v p , v 1 )$, $d ( v , v 1 ) = d ( v , v p ) + d ( v p , v 1 )$, $d ( u , v n ) = d ( u , v q ) + d ( v q , v n )$ and $d ( v , v n ) = d ( v , v q ) + d ( v q , v n )$. Thus, if $v p$ distinguishes u and v, so does $v 1$, otherwise $v q$ distinguishes them, which means that $v n$ also does.
According to the four cases above, we conclude that ${ v 1 , v n }$ is a local metric generator for G, so it is a simultaneous local metric generator for $G ′$. Thus, by Theorem 4, $Sd l ( G ) = Sd l ( G ′ ) ≤ 2$. ☐
Remark 4.
Let $C n$, $n ≥ 4$, be a cycle graph, and let e be an edge of its complement. If n is odd, then
$dim l ( add e ( C n ) ) = 2 .$
Otherwise,
$1 ≤ dim l ( add e ( C n ) ) ≤ 2 .$
Proof.
Consider $e = v i v j$. We have that $C n$ is bipartite for n even. If, additionally, $d C n ( v i , v j )$ is odd, then the graph $add e ( C n )$ is also bipartite, so $dim l ( add e ( C n ) ) = 1$. For every other case, $dim l ( add e ( C n ) ) ≥ 2$. From now on, we assume that $n ≥ 5$ and proceed to show that $dim l ( add e ( C n ) ) ≤ 2$. Note that $add e ( C n )$ is a bicyclic graph where $v i$ and $v j$ are vertices of degree three and the remaining vertices have degree two. We denote by $C n 1$ and $C n − n 1 + 2$ the two graphs obtained as induced subgraphs of $add e ( C n )$, which are isomorphic to a cycle of order $n 1$ and a cycle of order $n − n 1 + 2$, respectively. Since $n ≥ 5$, we have that $n 1 > 3$ or $n − n 1 + 2 > 3$. We assume, without loss of generality, that $n 1 > 3$. Let $a , b ∈ V ( C n 1 )$ are two vertices such that:
• if $n 1$ is even, $a b ∈ E ( C n 1 )$ and $d ( v i , a ) = d ( v j , b )$,
• if $n 1$ is odd, $a x , x b ∈ E ( C n 1 )$, where $x ∈ V ( C n 1 )$ is the only vertex such that $d ( x , v i ) = d ( x , v j )$.
We claim that ${ a , b }$ is a local metric generator for $add e ( C n )$. Consider two adjacent vertices $u , v ∈ V ( add e ( C n ) ) − { a , b }$. We differentiate the following cases, where the distances are taken in $add e ( C n )$:
• $u , v ∈ V ( C n 1 )$. It is simple to verify that ${ a , b }$ is a local metric generator for $C n 1$, hence $d ( u , a ) ≠ d ( v , a )$ or $d ( u , b ) ≠ d ( v , b )$.
• $u ∈ V ( C n 1 )$ and $v ∈ V ( C n − n 1 + 2 ) − { v i , v j }$. In this case, $u ∈ { v i , v j }$ and $d ( u , a ) < d ( v , a )$ or $d ( u , b ) < d ( v , b )$.
• $u , v ∈ V ( C n − n 1 + 2 ) − { v i , v j }$. In this case, if $d ( u , a ) = d ( v , a )$, then $d ( u , v i ) = d ( v , v i )$, so $d ( u , v j ) ≠ d ( v , v j )$ and, consequently, $d ( u , b ) ≠ d ( v , b )$.
According to the three cases above, ${ a , b }$ is a local metric generator for $add e ( C n )$, and as a result, the proof is complete. ☐
The next result is a direct consequence of Remarks 1 and 4.
Remark 5.
Let $C n$, $n ≥ 4$, be a cycle graph. If $e , e ′$ are two different edges of the complement of $C n$, then:
$1 ≤ Sd l ( add e ( C n ) , add e ′ ( C n ) ) = Sd l ( C n , add e ( C n ) , add e ′ ( C n ) ) ≤ 4 .$

## 4. Families of Corona Product Graphs

Let G and H be two graphs of order n and $n ′$, respectively. The corona product $G ⊙ H$ is defined as the graph obtained from G and H by taking one copy of G and n copies of H and joining by an edge each vertex from the i-th copy of H with the i-th vertex of G. Notice that the corona graph $K 1 ⊙ H$ is isomorphic to the join graph $K 1 + H$. Given a graph family $G = { G 1 , … , G k }$ on a common vertex set and a graph H, we define the graph family:
$G ⊙ H = { G 1 ⊙ H , … , G k ⊙ H } .$
Several results presented in [23,24] describe the behavior of the local metric dimension on corona product graphs. We now analyze how this behavior extends to the simultaneous local metric dimension of families composed by corona product graphs.
Theorem 6.
In references [23,25], Let G be a connected graph of order $n ≥ 2$. For any non-empty graph H,
$dim l ( G ⊙ H ) = n · adim l ( H ) .$
As we can expect, if we review the proof of the result above, we check that if A is a local metric basis of $G ⊙ H$, then A does not contain elements in $V ( G )$. Therefore, any local metric basis of $G ⊙ H$ is a simultaneous local metric basis of $G ⊙ H$. This fact and the result above allow us to state the following theorem.
Theorem 7.
Let $G$ be a family of connected non-trivial graphs on a common vertex set V. For any non-empty graph H,
$Sd l ( G ⊙ H ) = | V | · adim l ( H ) .$
Given a graph family $G$ on a common vertex set and a graph family $H$ on a common vertex set, we define the graph family:
$G ⊙ H = { G ⊙ H : G ∈ G and H ∈ H } .$
The following result generalizes Theorem 7. In what follows, we will use the notation $〈 v 〉$ for the graph $G = ( V , E )$ where $V = { v }$ and $E = ∅$.
Theorem 8.
For any family $G$ of connected non-trivial graphs on a common vertex set V and any family $H$ of non-empty graphs on a common vertex set,
$Sd l ( G ⊙ H ) = | V | · Sad l ( H ) .$
Proof.
Let $n = | V |$, and let $V ′$ be the vertex set of the graphs in $H$, $V i ′$ the copy of $V ′$ corresponding to $v i ∈ V$, $H i$ the i-th copy of $H$ and $H i ∈ H i$ the i-th copy of $H ∈ H$.
We first need to prove that any $G ∈ G$ satisfies $Sd l ( G ⊙ H ) = n · Sad l ( H )$. For any $i ∈ { 1 , … , n }$, let $S i$ be a simultaneous local adjacency basis of $H i$. In order to show that $X = ⋃ i = 1 n S i$ is a simultaneous local metric generator for $G ⊙ H$, we will show that X is a local metric generator for $G ⊙ H$, for any $G ∈ G$ and $H ∈ H$. To this end, we differentiate the following four cases for two adjacent vertices $x , y ∈ V ( G ⊙ H ) − X$.
• $x , y ∈ V i ′$. Since $S i$ is an adjacency generator of $H i$, there exists a vertex $u ∈ S i$ such that $| N H i ( u ) ∩ { x , y } | = 1$. Hence,
$d G ⊙ H ( x , u ) = d 〈 v i 〉 + H i ( x , u ) ≠ d 〈 v i 〉 + H i ( y , u ) = d G ⊙ H ( y , u ) .$
• $x ∈ V i ′$ and $y ∈ V$. If $y = v i$, then for $u ∈ S j$, $j ≠ i$, we have:
$d G ⊙ H ( x , u ) = d G ⊙ H ( x , y ) + d G ⊙ H ( y , u ) > d G ⊙ H ( y , u ) .$
Now, if $y = v j$, $j ≠ i$, then we also take $u ∈ S j$, and we proceed as above.
• $x = v i$ and $y = v j$. For $u ∈ S j$, we find that:
$d G ⊙ H ( x , u ) = d G ⊙ H ( x , y ) + d G ⊙ H ( y , u ) > d G ⊙ H ( y , u ) .$
• $x ∈ V i ′$ and $y ∈ V j ′$, $j ≠ i$. In this case, for $u ∈ S i$, we have:
$d G ⊙ H ( x , u ) ≤ 2 < 3 ≤ d G ⊙ H ( u , y ) .$
Hence, X is a local metric generator for $G ⊙ H$, and since $G ∈ G$ and $H ∈ H$ are arbitrary graphs, X is a simultaneous local metric generator for $G ⊙ H$, which implies that:
$Sd l ( G ⊙ H ) ≤ ∑ i = 1 n | S i | = n · Sad l ( H ) .$
It remains to prove that $Sd l ( G ⊙ H ) ≥ n · Sad l ( H ) .$ To do this, let W be a simultaneous local metric basis of $G ⊙ H$, and for any $i ∈ { 1 , … , n }$, let $W i = V i ′ ∩ W$. Let us show that $W i$ is a simultaneous adjacency generator for $H i$. To do this, consider two different vertices $x , y ∈ V i ′ − W i$, which are adjacent in $G ⊙ H$, for some $H ∈ H$. Since no vertex $a ∈ V ( G ⊙ H ) − V i ′$ distinguishes the pair $x , y$, there exists some $u ∈ W i$, such that $d G ⊙ H ( x , u ) ≠ d G ⊙ H ( y , u )$. Now, since $d G ⊙ H ( x , u ) ∈ { 1 , 2 }$ and $d G ⊙ H ( y , u ) ∈ { 1 , 2 }$, we conclude that $| N H i ( u ) ∩ { x , y } | = 1$, and consequently, $W i$ must be an adjacency generator for $H i$; and since $H ∈ H$ is arbitrary, $W i$ is a simultaneous local adjacency generator for $H i$. Hence, for any $i ∈ { 1 , … , n }$, $| W i | ≥ Sad l ( H i )$. Therefore,
$Sd l ( G ⊙ H ) = | W | ≥ ∑ i = 1 n | W i | ≥ ∑ i = 1 n Sad l ( H i ) = n · Sad l ( H ) .$
This completes the proof. ☐
The following result is a direct consequence of Theorem 8.
Corollary 2.
For any family $G$ of connected non-trivial graphs on a common vertex set V and any family $H$ of non-empty graphs on a common vertex set,
$Sd l ( G ⊙ H ) ≥ | V | · Sd l ( H ) .$
Furthermore, if every graph in $H$ has diameter two, then:
$Sd l ( G ⊙ H ) = | V | · Sd l ( H ) .$
Now, we give another result, which is a direct consequence of Theorem 8 and shows the general bounds of $Sd l ( G ⊙ H )$.
Corollary 3.
For any family $G$ of connected graphs on a common vertex set V, $| V | ≥ 2$ and any family $H$ of non-empty graphs on a common vertex set $V ′$,
$| V | ≤ Sd l ( G ⊙ H ) ≤ | V | ( | V ′ | − 1 ) .$
We now consider the case in which the graph H is empty.
Theorem 9.
In reference , Let G be a connected non-trivial graph. For any empty graph H,
$dim l ( G ⊙ H ) = dim l ( G ) .$
The result above may be extended to the simultaneous scenario.
Theorem 10.
Let $G$ be a family of connected non-trivial graphs on a common vertex set. For any empty graph H,
$Sd l ( G ⊙ H ) = Sd l ( G ) .$
Proof.
Let B be a simultaneous local metric basis of $G = { G 1 , G 2 , … , G k }$. Since H is empty, any local metric generator $B ′ ⊆ B$ of $G i$ is a local metric generator for $G i ⊙ H$, so B is a simultaneous local metric generator for $G ⊙ H$. As a consequence, $Sd l ( G ⊙ H ) ≤ Sd l ( G )$.
Suppose that A is a simultaneous local metric basis of $G ⊙ H$ and $| A | < | B |$. If there exists $x ∈ A ∩ V i j$ for the j-th copy of H in any graph $G i ⊙ H$, then the pairs of vertices of $G i ⊙ H$ that are distinguished by x can also be distinguished by $v i$. As a consequence, the set $A ′$ obtained from A by replacing by $v i$ each vertex $x ∈ A ∩ V i j , i ∈ { 1 , … , k } , j ∈ { 1 , … , n }$ is a simultaneous local metric generator for $G$ such that $| A ′ | ≤ | A | < Sd l ( G )$, which is a contradiction, so $Sd l ( G ⊙ H ) ≥ Sd l ( G )$. ☐
Theorem 11.
In reference , Let H be a non-empty graph. The following assertions hold.
1.
If the vertex of $K 1$ does not belong to any local metric basis of $K 1 + H$, then for any connected graph G of order n,
$dim l ( G ⊙ H ) = n · dim l ( K 1 + H ) .$
2.
If the vertex of $K 1$ belongs to a local metric basis of $K 1 + H$, then for any connected graph G of order $n ≥ 2$,
$dim l ( G ⊙ H ) = n · dim l ( K 1 + H ) − 1 .$
As for the previous case, the result above is extensible to the simultaneous setting.
Theorem 12.
Let $G$ be a family of connected non-trivial graphs on a common vertex set V, and let $H$ be a family of non-empty graphs on a common vertex set. The following assertions hold.
1.
If the vertex of $K 1$ does not belong to any simultaneous local metric basis of $K 1 + H$, then:
$Sd l ( G ⊙ H ) = | V | · Sd l ( K 1 + H ) .$
2.
If the vertex of $K 1$ belongs to a simultaneous local metric basis of $K 1 + H$, then:
$Sd l ( G ⊙ H ) = | V | · Sd l ( K 1 + H ) − 1 .$
Proof.
As above, let $n = | V |$, and let $V ′$ be the vertex set of the graphs in $H$, $V i ′$ the copy of $V ′$ corresponding to $v i ∈ V$, $H i$ the i-th copy of $H$ and $H i ∈ H i$ the i-th copy of $H ∈ H$.
We will apply a reasoning analogous to the one used for the proof of Theorem 11 in . If $n = 1$, then $G ⊙ H ≅ K 1 + H$, so the result holds. Assume that $n ≥ 2$, Let $S i$ be a simultaneous local metric basis of $〈 v i 〉 + H i$, and let $S i ′ = S i − { v i }$. Note that $S i ′ ≠ ∅$ because $H i$ is the family of non-empty graphs and $v i$ does not distinguish any pair of adjacent vertices belonging to $V i ′$. In order to show that $X = ∪ i = 1 n S i ′$ is a simultaneous local metric generator for $G ⊙ H$, we differentiate the following cases for two vertices $x , y$, which are adjacent in an arbitrary graph $G ⊙ H$:
• $x , y ∈ V i ′$. Since $v i$ does not distinguish $x , y$, there exists $u ∈ S i ′$ such that $d G ⊙ H ( x , u ) = d 〈 v i 〉 + H i ( x , u ) ≠ d 〈 v i 〉 + H i ( y , u ) = d G ⊙ H ( y , u )$.
• $x ∈ V i ′$ and $y = v i$. For $u ∈ S j ′$, $j ≠ i$, we have $d G ⊙ H ( x , u ) = 1 + d G ⊙ H ( y , u ) > d G ⊙ H ( y , u )$.
• $x = v i$ and $y = v j$. For $u ∈ S j ′$, we have $d G ⊙ H ( x , u ) = 2 = d G ⊙ H ( x , y ) + 1 > 1 = d G ⊙ H ( y , u )$.
Hence, X is a local metric generator for $G ⊙ H$, and since $G ∈ G$ and $H ∈ H$ are arbitrary graphs, X is a simultaneous local metric generator for $G ⊙ H$.
Now, we shall prove (1). If the vertex of $K 1$ does not belong to any simultaneous local metric basis of $K 1 + H$, then $v i ∉ S i$ for every $i ∈ { 1 , … , n }$, and as a consequence,
$Sd l ( G ⊙ H ) ≤ | X | = ∑ i = 1 n | S i ′ | = ∑ i = 1 n Sd l ( 〈 v i 〉 + H i ) = n · Sd l ( K 1 + H ) .$
Now, we need to prove that $Sd l ( G ⊙ H ) ≥ n · Sd l ( K 1 + H ) .$ In order to do this, let W be a simultaneous local metric basis of $G ⊙ H$, and let $W i = V i ′ ∩ W$. Consider two adjacent vertices $x , y ∈ V i ′ − W i$ in $G ⊙ H$. Since no vertex $a ∈ W − W i$ distinguishes the pair $x , y$, there exists $u ∈ W i$ such that $d 〈 v i 〉 + H i ( x , u ) = d G ⊙ H ( x , u ) ≠ d G ⊙ H ( y , u ) = d 〈 v i 〉 + H i ( y , u )$. Therefore, we conclude that $W i ∪ { v i }$ is a simultaneous local metric generator for $〈 v i 〉 + H i$. Now, since $v i$ does not belong to any simultaneous local metric basis of $〈 v i 〉 + H i$, we have that $| W i | + 1 = | W i ∪ { v i } | > Sd l ( 〈 v i 〉 + H i )$ and, as a consequence, $| W i | ≥ Sd l ( 〈 v i 〉 + H i )$. Therefore,
$Sd l ( G ⊙ H ) = | W | ≥ ∑ i = 1 n | W i | ≥ ∑ i = 1 n Sd l ( 〈 v i 〉 + H i ) = n · Sd l ( K 1 + H ) ,$
and the proof of (1) is complete.
Finally, we shall prove (2). If the vertex of $K 1$ belongs to a simultaneous local metric basis of $K 1 + H$, then we assume that $v i ∈ S i$ for every $i ∈ { 1 , … , n }$. Suppose that there exists B such that B is a simultaneous local metric basis of $G ⊙ H$ and $| B | < | X |$. In such a case, there exists $i ∈ { 1 , … , n }$ such that the set $B i = B ∩ V i ′$ satisfies $| B i | < | S i ′ |$. Now, since no vertex of $B − B i$ distinguishes the pairs of adjacent vertices belonging to $V i ′$, the set $B i ∪ { v i }$ must be a simultaneous local metric generator for $〈 v i 〉 + H i$. Therefore, $Sd l ( 〈 v i 〉 + H i ) ≤ | B i | + 1 < | S i ′ | + 1 = | S i | = Sd l ( 〈 v i 〉 + H i )$, which is a contradiction. Hence, X is a simultaneous local metric basis of $G ⊙ H$, and as a consequence,
$Sd l ( G ⊙ H ) = | X | = ∑ i = 1 n | S i ′ | = ∑ i = 1 n ( Sd l ( 〈 v i 〉 + H i ) − 1 ) = n ( Sd l ( K 1 + H ) − 1 ) .$
The proof of (2) is now complete. ☐
Corollary 4.
Let G be a connected graph of order $n ≥ 2$, and let $H = { K r 1 , n ′ − r 1 , K r 2 , n ′ − r 2 , … , K r k , n ′ − r k }$, $1 ≤ r i ≤ n ′ − 1$, be a family composed by complete bipartite graphs on a common vertex set $V ′$. Then,
$Sd l ( G ⊙ H ) = n .$
Proof.
For every $x ∈ V ′$, the set ${ v , x }$ is a simultaneous local metric basis of $〈 v 〉 + H$, so $Sd ( G ⊙ H ) = n · ( Sd ( K 1 + H ) − 1 ) = n$. ☐
Lemma 1.
In reference , Let H be a graph of radius $r ( H )$. If $r ( H ) ≥ 4$, then the vertex of $K 1$ does not belong to any local metric basis of $K 1 + H$.
Note that an analogous result holds for the simultaneous scenario.
Lemma 2.
Let $H$ be a graph family on a common vertex set V, such that $r ( H ) ≥ 4$ for every $H ∈ H$. Then, the vertex of $K 1$ does not belong to any simultaneous local metric basis of $K 1 + H$.
Proof.
Let B be a simultaneous local metric basis of ${ K 1 + H 1 , … , K 1 + H k }$. We suppose that the vertex v of $K 1$ belongs to B. Note that $v ∈ B$ if and only if there exists $u ∈ V − B$, such that $B ⊆ N K 1 + H i ( u )$ for some $H i ∈ H$. If $r ( H i ) ≥ 4$, proceeding in a manner analogous to that of the proof of Lemma 1 as given in , we take $u ′ ∈ V$ such that $d H i ( u , u ′ ) = 4$ and a shortest path $u u 1 u 2 u 3 u ′$. In such a case, for every $b ∈ B − { v }$, we will have that $d K 1 + H i ( b , u 3 ) = d K 1 + H i ( b , u ′ ) = 2$, which is a contradiction. Hence, v does not belong to any simultaneous local metric basis of ${ K 1 + H 1 , K 1 + H 2 , … , K 1 + H k }$. ☐
As a direct consequence of item (1) of Theorem 12 and Lemma 2, we obtain the following result.
Proposition 1.
For any family $G$ of connected graphs on a common vertex set V and any graph family $H$ on a common vertex set $V ′$ such that $r ( H ) ≥ 4$ for every $H ∈ H$,
$Sd l ( G ⊙ H ) = | V | · Sd l ( K 1 + H ) .$

## 5. Families of Lexicographic Product Graphs

Let $G = { G 1 , ⋯ , G r }$ be a family of connected graphs with common vertex set $V = { u 1 , ⋯ , u n }$. For each $u i ∈ V$, let $H i = { H i 1 , ⋯ H i s i }$ be a family of graphs with common vertex set $V i$. For each $i = 1 , ⋯ , n$, choose $H i j ∈ H i$ and consider the family $H j = { H 1 j , H 2 j , ⋯ , H n j }$. Notice that the families $H i$ can be represented in the following scheme where the columns correspond to the families $H j$.
$H 1 = { H 11 , ⋯ H 1 j , ⋯ H 1 s 1 } defined on V 1 ⋮ ⋮ ⋮ ⋮ H i = { H i 1 , ⋯ H i j , ⋯ H i s i } defined on V i ⋮ ⋮ ⋮ ⋮ H n = { H n 1 , ⋯ H n j , ⋯ H n s n } defined on V n$
For a graph $G k ∈ G$ and the family $H j$, we define the lexicographic product of $G k$ and $H j$ as the graph $G k ∘ H j$ such that $V ( G k ∘ H j ) = ⋃ u i ∈ V ( { u i } × V i )$ and $( u i 1 , v ) ( u i 2 , w ) ∈ E ( G k ∘ H j )$ if and only if $u i 1 u i 2 ∈ E ( G k )$ or $i 1 = i 2$ and $v w ∈ E ( H i 1 j )$. Let $H = { H 1 , H 2 , ⋯ H s }$. We are interested in the simultaneous local metric dimension of the family:
$G ∘ H = { G k ∘ H j : G k ∈ G , H j ∈ H } .$
The relation between distances in a lexicographic product graph and those in its factors is presented in the following remark.
Remark 6.
If $( u , v )$ and $( u ′ , v ′ )$ are vertices of $G ∘ H$, then:
We point out that the remark above was stated in [26,27] for the case where $H i j ≅ H$ for all $H i j ∈ H j$. By Remark 6, we deduce that if $u ∈ V − { u i }$, then two adjacent vertices $( u i , w ) , ( u i , y )$ are not distinguished by $( u , v ) ∈ V ( G ∘ H )$. Therefore, we can state the following remark.
Remark 7.
If B is a simultaneous local metric generator for the family of lexicographic product graphs $G ∘ H$, then $B i = { v : ( u i , v ) ∈ B }$ is a simultaneous local adjacency generator for $H i$.
In order to state our main result (Theorem 13), we need to introduce some additional notation. Let B be a simultaneous local adjacency generator for a family of non-trivial connected graphs $H i = { H i 1 , ⋯ , H i s }$ on a common vertex set $V i$, and let $G ∘ H$ be family of lexicographic product graphs defined as above.
• $D [ H i , B ] = { v ∈ V i : B ⊆ N H i j ( v ) for some H i j ∈ H i }$.
• If $D [ H i , B ] ≠ ∅$, then we define the graph $D [ H i , B ]$ in the following way. The vertex set of $D [ H i , B ]$ is $D [ H i , B ]$, and two vertices $v , w$ are adjacent in $D [ H i , B ]$ if and only if for for every $H i j ∈ H i$, $v w ∉ E ( H i j )$.
• If $D [ H i , B ] = ∅$, then define $Ψ ( B ) = | B |$, otherwise $Ψ ( B ) = γ ( D [ H i , B ] ) + | B |$, where $γ ( D [ H i , B ] )$ represents the domination number of $D [ H i , B ]$.
• $Γ ( H i ) = { C ⊆ V i : C is a simultaneous local adjacency generator for H i }$
• $Ψ ( H i ) = min { Ψ ( B ) : B ∈ Γ ( H i ) } .$
• $S 0$ is a family composed by empty graphs.
• $Φ ( V , H ) = { u i ∈ V : H i ⊆ S 0 }$
• $I ( V , H ) = { u i ∈ V : Ψ ( H i ) > Sad l ( H i ) } .$ Notice that $Φ ( V , H ) ⊆ I ( V , H )$.
• $Υ ( V , H )$ is the family of subsets of $I ( V , H )$ as follows. We say that $A ∈ Υ ( V , H )$ if for every $u ′ , u ″ ∈ I ( V , H ) − A$ such that $u ′ u ″ ∈ E ( G k )$, for some $G k ∈ G$, there exists $u ∈ ( A ∪ ( V − Φ ( V , H ) ) ) − { u ′ , u ″ }$ such that $d G k ( u , u ′ ) ≠ d G k ( u , u ″ )$.
• $G ( G , I ( V , H ) )$ is the graph with vertex set $I ( V , H )$ and edge set $E$ such that $u i u j ∈ E$ if and only if there exists $G k ∈ G$ such that $u i u j ∈ E ( G k )$.
Remark 8.
$Ψ ( H i ) = 1$ if and only if $H i , j ≅ N | V i |$ for every $H i , j ∈ H i$.
Proof.
If $H i , j ≅ N | V i |$ for every $H i , j ∈ H i$, then $B = ∅$ is the only simultaneous local adjacency basis of $H i$, $D [ H i , ∅ ] ≅ K | V i |$, and then, $Ψ ( H i ) = γ ( K | V i | ) = 1$. On the other hand, suppose that $H i , j ≅ N | V i |$ for some $H i , j ∈ H i$. In this case, $Sad l ( H i ) ≥ 1$. If $Sad l ( H i ) > 1$, then we are done. Suppose that $Sad l ( H i ) = 1$. For any simultaneous local adjacency basis $B = { v 1 }$ of $H i$, there exists $v 2 ∈ N H i j ( v 1 )$ for some $H i j$, which implies that $D [ H i , { v 2 } ] ≠ ∅$ and so $| γ ( D [ H i , { v 2 } ] ) | ≥ 1$. Therefore, $Ψ ( H i ) ≥ 2$, and the result follows. ☐
As we will show in the next example, in order to get the value of $Ψ ( H i )$, it is interesting to remark about the necessity of considering the family $Γ ( H i )$ of all simultaneous local adjacency generators and not just the family of simultaneous local adjacency bases of $H i$.
Example 1.
Let $H 1 ≅ H 2 ≅ P 5$ be two copies of the path graph on five vertices such that $V ( H 1 ) = V ( H 2 ) = { v 1 , v 2 , ⋯ , v 5 }$, whereas $E ( H 1 ) = { v 1 v 2 , v 2 v 3 , v 3 v 4 , v 4 v 5 }$ and $E ( H 2 ) = { v 2 v 1 , v 1 v 3 , v 3 v 5 , v 5 v 4 }$. Consider the family $H = { H 1 , H 2 }$. We have that $B 1 = { v 3 }$ is a simultaneous local adjacency basis of $H$ and $B 2 = { v 1 , v 4 }$ is a simultaneous local adjacency generator for $H$. Then, $D [ H , B 1 ] = { v 1 , v 2 , v 4 , v 5 }$, $E ( D [ H , B 1 ] ) = { v 1 v 4 , v 4 v 2 , v 2 v 5 , v 5 v 1 }$, $γ ( D [ G , B 1 ] ) = 2$, $Ψ ( B 1 ) = 2 + 1 = 3$. However, $D [ H , B 2 ] = ∅$ and $Ψ ( B 2 ) = 2$.
We define the following graph families.
• $S 1$ is the family of graphs having at least two non-trivial components.
• $S 2$ is the family of graphs having at least one component of radius at least four.
• $S 3$ is the family of graphs having at least one component of girth at least seven.
• $S 4$ is the family of graphs having at least two non-singleton true twin equivalence classes $U 1 , U 2$ such that $d ( U 1 , U 2 ) ≥ 3$.
Lemma 3.
Let $H ⊆ S 0$ be a family of graphs on a common vertex set V. If $H ⊆ ⋃ i = 0 4 S i$, then:
$Ψ ( H ) = Sad l ( H ) .$
Proof.
Let B be a simultaneous local adjacency generator for $H$ and $v ∈ V$. We claim that $B ⊆ N H ( v )$. To see this, we differentiate the following cases for $H ∈ H$.
• H has two non-trivial connected components $J 1 , J 2$. In this case, $B ∩ J 1 ≠ ∅$ and $B ∩ J 2 ≠ ∅$, which implies that $B ⊆ N H ( v )$.
• H has one non-trivial component J such that $r ( J ) ≥ 4$. If H has two non-trivial components, then we are in the first case. Therefore, we can assume that J is the only non-trivial component of H. Suppose that $B ⊆ N H ( v )$, and get $v ′ ∈ V$ such that $d H ( v , v ′ ) = 4$. If $v v 1 v 2 v 3 v ′$ is a shortest path from v to $v ′$, then $v 3$ and $v ′$ are adjacent, and they are not distinguished by the elements in B, which is a contradiction.
• H has one non-trivial component J of girth g$( J ) ≥ 7$. In this case, if H has two non-trivial components, then we are in the first case. Therefore, we can assume that H has just one non-trivial component of girth g$( J ) ≥ 7$. Suppose that $B ⊆ N H ( v )$. For each cycle $v 1 v 2 ⋯ v n v 1$, there exists $v i v i + 1 ∈ E ( J )$ such that $d H ( v , v i ) ≥ 3$ and $d H ( v , v i + 1 ) ≥ 3$; therefore, for each $b ∈ B$, we have $d H ( b , v i ) ≥ 2$ and $d H ( b , v i + 1 ) ≥ 2$, which is a contradiction.
• H has two non-singleton true twin equivalence classes $U 1 , U 2$ such that $d H ( U 1 , U 2 ) ≥ 3$. Since $B ∩ U 1 ≠ ∅$ and $B ∩ U 2 ≠ ∅$, we can conclude that $B ⊆ N H ( v )$.
• $H ≅ N | V |$. Notice that $B ≠ ∅$, as $H ⊆ S 0$, so that $B ⊆ ∅ = N H ( v )$.
According to the five cases above, $H ⊆ ∪ i = 0 4 S i$ leads to $D [ H , B ] = ∅$, for any simultaneous local adjacency generator, which implies that $Ψ ( H ) = Sad l ( H )$. ☐
Remark 9.
If $A ∈ Υ ( V , H )$, then $A ∪ ( V − Φ ( V , H ) )$ is a simultaneous local metric generator for $G$. However, the converse is not true, as we can see in the following example.
Example 2.
Consider the family of connected graphs $G = { G 1 , G 2 , G 3 }$ on a common vertex set $V = { u 1 , ⋯ , u 8 }$ with $E ( G i ) = { u 1 u 2 , u 1 u 2 i + 1 , u 2 u 2 i + 2 ,$$u j u 2 i + 1 , u j u 2 i + 2 ,$ for $j ∉ { 1 , 2 , 2 i + 1 , 2 i + 2 } }$. Let $H i$ be the family consisting of only one graph $H i$, as follows: $H 1 ≅ H 2 ≅ K 2$, $H 3 ≅ H 4 ≅ ⋯ ≅ H 8 ≅ N 2$. We have that $G ∘ H = { G i ∘ { H 1 , ⋯ , H 8 } , i = 1 , 2 , 3 }$ and $I ( V , H ) = V$. If we take $A = ∅$, then $A ∪ ( V − Φ ( V , H ) ) = { u 1 , u 2 } ⊆ I ( V , H )$ is a simultaneous local metric basis of $G$. However, $∅ ∉ Υ ( V , H )$ because $u 1$ is adjacent to $u 2$ in $G i$, $i ∈ { 1 , 2 , 3 }$, and $( V − Φ ( V , H ) ) − { u 1 , u 2 } = ∅$.
Lemma 4.
Let $G ∘ H$ be a family of lexicographic product graphs. Let $B ⊆ V$ be a simultaneous local metric generator for $G$. Then, $B ∩ I ( V , H ) ∈ Υ ( V , H )$.
Proof.
Let $A = B ∩ I ( V , H )$ and $u i , u j ∈ I ( V , H ) − A = I ( V , H ) − B$. Since $B ⊆ V$ is a simultaneous local metric generator for $G$, for each $G k ∈ G$, there exists $b ∈ B$ such that $d G k ( b , u i ) ≠ d G k ( b , u j )$. If $b ∉ I ( V , H )$, then necessarily $b ∈ ( V − I ( V , H ) ) ⊆ ( ( V − Φ ( V , H ) ) − { u i , u j } )$, and if $b ∈ I ( V , H )$, then $b ∈ A − { u i , u j }$; and we are done. ☐
Corollary 5.
If there exists a simultaneous local metric generator B for $G$ such that $B ⊆ V − I ( V , H )$ or the graph $G ( G , I ( V , H ) )$ is empty, then $∅ ∈ Υ ( V , H )$.
Remark 10.
If B is a vertex cover of $G ( G , I ( V , H )$, then $B ∈ Υ ( V , H )$.
Lemma 5.
Let $G ∘ H$ be a family of lexicographic product graphs. For each $u i ∈ V$, let $B i ⊆ V i$ be a simultaneous local adjacency generator for $H i$, and let $C i ⊆ V i$ be a dominating set of $D [ H i , B i ]$. Then, for any $A ∈ Υ ( V , H )$, the set $B = ( ∪ u i ∈ A { u i } × ( B i ∪ C i ) ) ⋃ ( ∪ u i ∉ A { u i } × B i )$ is a local metric generator for $G ∘ H$.
Proof.
In order to prove the lemma, let $G k ∈ G$, $H j ∈ H$, and let $( u i 1 , v 1 ) , ( u i 2 , v 2 )$ be a pair of adjacent vertices of $G k ∘ H j$. If $i 1 = i 2$, then there exists $v ∈ B i 1$ such that $( u i 1 , v )$ distinguishes the pair. Otherwise, $i 1 ≠ i 2$, and we consider the following cases:
• $| { u i 1 , u i 2 } ∩ I ( V , H ) | ≤ 1$, say $u i 1 ∉ I ( V , H )$. In this case, there exists $v ∈ B i 1$ such that $v v 1 ∉ E ( H i 1 j )$, and then, $( u i 1 , v )$ distinguishes the pair.
• $u i 1 , u i 2 ∈ I ( V , H )$ and ${ u i 1 , u i 2 } ∩ A = ∅$. In this case, by definition of A, there exists $u i 3 ∈ ( A ∪ ( V − Φ ( V , H ) ) ) − { u i 1 , u i 2 }$ such that $d G k ( u i 3 , u i 1 ) ≠ d G k ( u i 3 , u i 2 )$. For any $v ∈ B i 3 ∪ C i 3$,
$d G k ∘ H j ( ( u i 3 , v ) , ( u i 1 , v 1 ) ) = d G k ( u i 3 , u i 1 ) ≠$
$d G k ( u i 3 , u i 2 ) = d G k ∘ H j ( ( u i 3 , v ) , ( u i 2 , v 2 ) ) .$
• $u i 1 , u i 2 ∈ I ( V , H )$ and $| { u i 1 , u i 2 } ∩ A | ≥ 1$, say $u i 1 ∈ A$. In this case, if there exists $v ∈ B i 1$ such that $v v 1 ∉ E ( H i 1 j )$, then $( u i 1 , v )$ distinguishes the pair. Otherwise, $v 1$ is a vertex of $D [ H i 1 , B i 1 ]$, and either $v 1 ∈ C i 1$ and $( u i 1 , v 1 ) ∈ B$ distinguishes the pair or there exists $v ∈ C i 1$, such that $v v 1 ∈ E ( D [ H i 1 , B i 1 ] )$, which means $v v 1 ∉ E ( H i 1 j )$; then, $( u i 1 , v )$ distinguishes the pair.
☐
Corollary 6.
Let $G ∘ H$ be a family of lexicographic product graphs. Then:
$Sd l ( G ∘ H ) ≤ min A ∈ Υ ( V , H ) ∑ u i ∈ A Ψ ( H i ) + ∑ u i ∉ A Sad l ( H i ) .$
Proof.
Let $A ∈ Υ ( V , H )$. For each $u i ∉ A$, let $B i ⊆ V i$ be a simultaneous local adjacency basis of $H i$. For each $u i ∈ A$, let $B i$ be a local adjacency generator for $H i$ and $C i ⊆ V i$ a dominating set of $D ( H i , B i )$ such that $| B i ∪ C i | = Ψ ( H i )$. Let:
$B = ( ∪ u j ∈ A { u j } × ( B j ∪ C j ) ) ⋃ ( ∪ u i ∉ A { u i } × B i )$
then, by Lemma 5, B is a simultaneous local metric generator for $G ∘ H$, and:
$Sd l ( G ∘ H ) ≤ | B | = ∑ u i ∈ A Ψ ( H i ) + ∑ u i ∉ A Sad l ( H i )$
As $A ∈ Υ ( V , H )$ is arbitrary:
$Sd l ( G ∘ H ) ≤ min A ∈ Υ ( V , H ) ∑ u i ∈ A Ψ ( H i ) + ∑ u i ∉ A Sad l ( H i )$
and the result follows. ☐
Lemma 6.
Let F be a simultaneous local metric basis of $G ∘ H$. Let $F i = { v ∈ V i : ( u i , v ) ∈ F }$ and $X F = { u i ∈ I ( V , H ) : | F i | ≥ Ψ ( H i ) }$. Then, $X F ∈ Υ ( V , H )$.
Proof.
Suppose, for the purpose of contradiction, that $X F ∉ Υ ( V , H )$. That means that there exist $u i 1 , u i 2 ∈ I ( V , H ) − X F$ and $G k ∈ G$ such that $u i 1 u i 2 ∈ E ( G k )$, and $d G k ( u , u i 1 ) = d G k ( u , u i 2 )$ for every $u ∈ ( X F ∪ ( V − Φ ( V , H ) ) ) − { u i 1 , u i 2 }$. As $u i 1 , u i 2 ∈ I ( V , H ) − X F$, $| F i 1 | < Ψ ( H i 1 )$ and $| F i 2 | < Ψ ( H i 2 )$, so that there exist $H i 1 j 1 ∈ H i 1$ and $H i 2 j 2 ∈ H i 2$ such that for some $v 1 ∈ V i 1$, $v 2 ∈ V i 2$, $F i 1 ⊆ N H i 1 j 1 ( v 1 )$ and $F i 2 ⊆ N H i 2 j 2 ( v 2 )$. Let $H j$ be such that $H i 1 j 1 , H i 2 j 2 ∈ H j$. Consider the pair of vertices $( u i 1 , v 1 ) , ( u i 2 , v 2 )$ adjacent in $G k ∘ H j$. As F is a simultaneous local metric generator, there exists $( u i 3 , v ) ∈ F$ that resolves the pair, which implies that $F i 3 ≠ ∅$. By hypothesis $u i 3 ∈ ( Φ ( V , H ) − X F ) ∪ { u i 1 , u i 2 }$, and so, $u i 3 ∈ { u i 1 , u i 2 }$. Without loss of generality, we assume that $u i 3 = u i 1$ and, in this case,
$d G k ∘ H j ( ( u i 3 , v ) , ( u i 1 , v 1 ) ) = d H i 1 j 1 , 2 ( v , v 1 ) = d G k ( u i 3 , u i 2 ) = d G k ∘ H j ( ( u i 3 , v ) , ( u i 2 , v 2 ) ) ,$
which is a contradiction. Therefore, $X F ∈ Υ ( V , H )$. ☐
Theorem 13.
Let $G ∘ H$ be a family of lexicographic product graphs.
$Sd l ( G ∘ H ) = min A ∈ Υ ( V , H ) ∑ u i ∈ A Ψ ( H i ) + ∑ u i ∉ A Sad l ( H i )$
Proof.
Let B be a simultaneous local metric basis of $G ∘ H$. Let $B i = { v ∈ V i : ( u i , v ) ∈ B }$ and $X B = { u i ∈ I ( V , H ) : | B i | ≥ Ψ ( H i ) }$. By Remark 7, $| B i | ≥ Sad l ( H i )$ for every $u i ∈ V$, so that Lemma 6 leads to:
$min A ∈ Υ ( V , H ) ∑ u i ∈ A Ψ ( H i ) + ∑ u i ∉ A Sad l ( H i ) ≤ ∑ u i ∈ X B Ψ ( H i ) + ∑ u i ∉ X B Sad l ( H i ) ≤ | B |$
and the result follows by Corollary 6. ☐
Now, we will show some cases where the calculation of $Sd l ( G ∘ H )$ is easy. At first glance, we have two main types of simplification: first, to simplify the calculation of $Ψ ( H i )$ and, second, the calculation of the $A ∈ Υ ( V , H )$ that makes the sum achieves its minimum.
For the first type of simplification, we can apply Lemma 3 to deduce the following corollary.
Corollary 7.
If for each i, $H i ⊆ S 0$ and $H i ⊆ ⋃ j = 0 4 S j$, then:
$Sd l ( G ∘ H ) = ∑ Sad l ( H i ) .$
Given a family $G$ of graphs on a common vertex set V and a graph H, we define the family of lexicographic product graphs:
$G ∘ H = { G ∘ H : G ∈ G } .$
By Theorem 13, we deduce the following result.
Corollary 8.
Let $G$ be a family of graphs on a common vertex set V, and let H be a graph. If for every local adjacency basis B of H, $B ⊆ N H ( v )$ for every $v ∈ V ( H ) − B$, then:
$Sd l ( G ∘ H ) = | V | adim l ( H ) .$
By Corollary 5 and Theorem 13, we have the following result.
Proposition 2.
If $V − I ( V , H )$ is a simultaneous local metric generator for $G$ or the graph $G ( G , I ( V , H ) )$ is empty, then:
$Sd l ( G ∘ H ) = ∑ Sad l ( H i )$
For the second type of simplification, we have the following remark.
Remark 11.
As $Sad l ( H i ) ≤ Ψ ( H i )$, if $A ⊆ B ⊆ V$, then:
$∑ u i ∈ A Ψ ( H i ) + ∑ u i ∉ A Sad l ( H i ) ≤ ∑ u i ∈ B Ψ ( H i ) + ∑ u i ∉ B Sad l ( H i )$
From Remark 11, we can get some consequences of Theorem 13.
Proposition 3.
Let $G ∘ H$ be a family of lexicographic product graphs. For any vertex cover B of $G ( G , I ( V , H ) )$,
$Sd l ( G ∘ H ) ≤ ∑ u i ∈ B Ψ ( H i ) + ∑ u i ∉ B Sad l ( H i )$
Proposition 4.
Let $G$ be a family of connected graphs with common vertex set V, and let $G ∘ H$ be a family of lexicographic product graphs. The following statements hold.
1.
If the subgraph of $G j$ induced by $I ( V , H )$ is empty for every $G j ∈ G$, then:
$Sd l ( G ∘ H ) = ∑ u i ∈ V Sad l ( H i ) .$
2.
Let $u i 0 ∈ I ( V , H )$ be such that $Ψ ( H i 0 ) = max { Ψ ( u i ) : u i ∈ I ( V , H ) }$. If $Sd l ( G ) = | V | − 1$ and $| I ( V , H ) | ≥ 2$, then:
$Sd l ( G ∘ H ) = ∑ u i ∉ I ( V , H ) Sad l ( H i ) + ∑ u i ∈ I ( V , H ) − { u i 0 } Ψ ( H i ) + Sad l ( H i 0 )$
Proof.
It is clear that if the subgraph of $G j$ induced by $I ( V , H )$ is empty for every $G j ∈ G$, then $∅ ∈ Υ ( V , H )$, so that Theorem 13 leads to (1). On the other hand, let $G$ be a family of connected graphs with common vertex set V such that $Sd l ( G ) = | V | − 1$ and $| I ( V , H ) | ≥ 2$. By Lemma 1, for every $u i , u j ∈ I ( V , H )$, there exists $G i j ∈ G$ such that $u i , u j$ are true twins in $G i j$. Hence, no vertex $u ∉ { u i , u j }$ resolves $u i$ and $u j$. Therefore, $A ∈ Υ ( V , H )$ implies $| A | = | I ( V , H ) | − 1$, and (2) follows from Theorem 13 and Remark 11. ☐
Proposition 5.
Let $G$ be a family of non-trivial connected graphs with common vertex set V. For any family of lexicographic product graphs $G ∘ H$,
$Sd l ( G ∘ H ) ≥ Sd l ( G ) .$
Furthermore, if $H = { N | V 1 | , ⋯ , N | V n | }$, then:
$Sd l ( G ∘ H ) = Sd l ( G ) .$
Proof.
Let W be a simultaneous local metric basis of $G ∘ H$ and $W V = { u ∈ V : ( u , v ) ∈ W }$. We suppose that $W V$ is not a simultaneous local metric generator for $G$. Let $u i , u j ∉ W V$ and $G ∈ G$ such that $u i u j ∈ E ( G )$ and $d G ( u i , u ) = d G ( u j , u )$ for every $u ∈ W V$. Thus, for any $v ∈ V i$, $v ′ ∈ V j$ and $( x , y ) ∈ W$, we have:
$d G ∘ H i ( ( x , y ) , ( u i , v ) ) = d G ( x , u i ) = d G ( x , u j ) = d G ∘ H i ( ( x , y ) , ( u j , v ′ ) ) ,$
which is a contradiction. Therefore, $W V$ is a simultaneous local metric generator for $G$ and, as a result, $Sd l ( G ) ≤ | W V | ≤ | W | = Sd l ( G ∘ H )$.
On the other hand, if $H = { N | V 1 | , ⋯ , N | V n | }$, then $V = I ( V , H ) = Φ ( V , H )$. Let $B ⊆ V$ be a simultaneous local metric basis of $G$. Now, for each $u i ∈ B$, we choose $v i ∈ V i$, and by Remark 9, we claim that $B ′ = { ( u i , v i ) : u i ∈ B }$ is a simultaneous local metric generator for $G ∘ H$. Thus, $Sd l ( G ∘ H ) ≤ | B ′ | = | B | = Sd l ( G )$. ☐
Proposition 6.
Let $G ≠ { K 2 }$ be a family of non-trivial connected bipartite graphs with common vertex set V and $H ≠ { H 1 , ⋯ , H n }$ such that $H j ⊆ S 0$, for some j. If $V = I ( V , H )$ and there exist $u 1 , u 2 ∈ V$ and $G k ∈ G$ such that $V − Φ ( V , H ) = { u 1 , u 2 }$ and $u 1 u 2 ∈ E ( G k )$, then:
$Sd l ( G ∘ H ) = ∑ Sad l ( H i ) + 1 ,$
otherwise,
$Sd l ( G ∘ H ) = ∑ Sad l ( H i ) .$
Proof.
If $V = I ( V , H )$ and there exist $u 1 , u 2 ∈ V$ and $G k ∈ G$ such that $V − Φ ( V , H ) = { u 1 , u 2 }$ and $u 1 u 2 ∈ E ( G k )$, then $∅ ∉ Υ ( V , H )$ because no vertex in $( V − Φ ( V , H ) ) − { u 1 , u 2 } = ∅$ distinguishes $u 1$ and $u 2$. Let $x , y ∈ I ( V , H )$ such that $x y ∈ ∪ G ∈ G E ( G )$. Since any $u i ∈ Φ ( V , H )$ distinguishes x and y, we can conclude that ${ u i } ∈ Υ ( V , H )$, and by Remark 8, $Ψ ( H i ) = 1$. Therefore, Theorem 13 leads to $Sd l ( G ∘ H ) = ∑ Sad l ( H i ) + 1 .$
Assume that there exists $u i ∈ V − I ( V , H )$, or $V − Φ ( V , H ) = { u i }$, or $V − Φ ( V , H ) = { u i , u j }$ and, for every $G k ∈ G$, $u i u j ∉ E ( G k )$ or ${ u i , u j , u k } ⊆ V − Φ ( V , H )$. In any one of these cases ${ u i }$ is a simultaneous local metric basis of $G$ and, for every pair $u 1 , u 2$ of adjacent vertices in some $G k ∈ G$ such that $u i ∉ { u 1 , u 2 }$, $u i$ distinguishes the pair. Since $u i ∈ V − Φ ( V , H )$, we can claim that $∅ ∈ Υ ( V , H )$, and by Theorem 13, $Sd l ( G ∘ H ) = ∑ Sad l ( H i ) .$ ☐

#### 5.1. Families of Join Graphs

For two graph families $G = { G 1 , … , G k 1 }$ and $H = { H 1 , … , H k 2 }$, defined on common vertex sets $V 1$ and $V 2$, respectively, such that $V 1 ∩ V 2 = ∅$, we define the family:
$G + H = { G i + H j : 1 ≤ i ≤ k 1 , 1 ≤ j ≤ k 2 } .$
Notice that, since for any $G i ∈ G$ and $H j ∈ H$ the graph $G i + H j$ has diameter two,
$Sd l ( G + H ) = Sad l ( G + H ) .$
The following result is a direct consequence of Theorem 13.
Corollary 9.
For any pair of families $G$ and $H$ of non-trivial graphs on common vertex sets $V 1$ and $V 2$, respectively,
$Sd l ( G + H ) = min { Sd A , l ( G ) + Ψ ( H ) , Sd A , l ( H ) + Ψ ( G ) }$
Remark 12.
Let $G$ be a family of graphs defined on a common vertex set $V 1$. If there exists B a simultaneous local adjacency basis of $G$ such that $D [ G , B ] = ∅$, then for every $H$ family of graphs defined on a common vertex set $V 2$, we have:
$Sd l ( G + H ) = Sad l ( G ) + Sad l ( H )$
By Lemma 3 and Remark 12, we deduce the following result.
Proposition 7.
Let $G$ and $H$ be two families of non-trivial connected graphs on a common vertex set $V 1$ and $V 2$, respectively. If $G ⊆ ∪ i = 1 4 S i$, then:
$Sd l ( G + H ) = Sad l ( G ) + Sad l ( H ) .$

## 6. Computability of the Simultaneous Local Metric Dimension

In previous sections, we have seen that there is a large number of classes of graph families for which the simultaneous local metric dimension is well determined. This includes some cases of graph families whose simultaneous metric dimension is hard to compute, e.g., families composed by trees , yet the simultaneous local metric dimension is constant. However, as proven in , the problem of finding the local metric dimension of a graph is NP-hard in the general case, which trivially leads to the fact that finding the simultaneous local metric dimension of a graph family is also NP-hard in the general case.
Here, we will focus on a different aspect, namely that of showing that the requirement of simultaneity adds to the computational difficulty of the original problem. To that end, we will show that there exist families composed by graphs whose individual local metric dimensions are constant, yet it is hard to compute their simultaneous local metric dimension.
To begin with, we will formally define the decision problems associated with the computation of the local metric dimension of one graph and the simultaneous local metric dimension of a graph family.
• Local metric Dimension (LDIM)
Instance: A graph $G = ( V , E )$ and an integer p, $1 ≤ p ≤ | V ( G ) | − 1$.
Question: Is $dim l ( G ) ≤ p$?
• Simultaneous Local metric Dimension (SLD)
Instance: A graph family $G = { G 1 , G 2 , … , G k }$ on a common vertex set V and an integer p, $1 ≤ p ≤ | V | − 1$.
Question: Is $Sd l ( G ) ≤ p$?
As we mentioned above, LDIM was proven to be NP-complete in . Moreover, it is simple to see that determining whether a vertex set $S ⊆ V$, $| S | ≤ p$, is a simultaneous local metric generator can be done in polynomial time, so SLD is in NP. In fact, SLD can be easily shown to be NP-complete, since for any graph $G = ( V , E )$ and any integer $1 ≤ p ≤ | V ( G ) | − 1$, the corresponding instance of LDIM can be trivially transformed into an instance of SLD by making $G = { G }$.
For the remainder of this section, we will address the issue of the complexity added by the requirement of simultaneity. To this end, we will consider families composed by the so-called tadpole graphs . An $( h , t )$-tadpole graph (or $( h , t )$-tadpole for short) is the graph obtained from a cycle graph $C h$ and a path graph $P t$ by joining with an edge a leaf of $P t$ to an arbitrary vertex of $C h$. We will use the notation $T h , t$ for $( h , t )$-tadpoles. Since $( 2 q , t )$-tadpoles are bipartite, we have that $dim l ( T 2 q , t ) = 1$. In the case of $( 2 q + 1 , t )$-tadpoles, we have that $dim l ( T 2 q + 1 , t ) = 2$, as they are not bipartite (so, $dim l ( T 2 q + 1 , t ) ≥ 2$), and any set composed by two vertices of the subgraph $C 2 q + 1$ is a local metric generator (so, $dim l ( T 2 q + 1 , t ) ≤ 2$). Additionally, consider the sole vertex v of degree three in $T 2 q + 1 , t$ and a local metric generator for $T 2 q + 1 , t$ of the form ${ v , x }$, $x ∈ V ( C 2 q + 1 ) − { v }$. It is simple to verify that for any vertex $y ∈ V ( P t )$, the set ${ y , x }$ is also a local metric generator for $T 2 q + 1 , t$.
Consider a family $T = { T h 1 , t 1 , T h 2 , t 2 , … , T h k , t k }$ composed by tadpole graphs on a common vertex set V. By Theorem 4, we have that $Sd l ( T ) = Sd l ( T ′ )$, where $T ′$ is composed by $( 2 q + 1 , t )$-tadpoles. As we discussed previously, $dim l ( T 2 q + 1 , t ) = 2$. However, by Remark 1 and Theorem 1, we have that $2 ≤ Sd l ( T ′ ) ≤ | V | − 1$. In fact, both bounds are tight, since the lower bound is trivially satisfied by unitary families, whereas the upper bound is reached, for instance, by any family composed by all different labeled graphs isomorphic to an arbitrary $( 3 , t )$-tadpole, as it satisfies the premises of Theorem 1. Moreover, as we will show, the problem of computing $Sd l ( T ′ )$ is NP-hard, as its associated decision problem is NP-complete. We will do so by showing a transformation from the hitting set problem, which was shown to be NP-complete by Karp . The hitting set problem is defined as follows:
• Hitting Set Problem (HSP)
• Instance: A collection $C = { C 1 , C 2 , … , C k }$ of non-empty subsets of a finite set S and a positive integer $p ≤ | S |$.
• Question: Is there a subset $S ′ ⊆ S$ with $| S ′ | ≤ p$ such that $S ′$ contains at least one element from each subset in $C$?
Theorem 14.
The Simultaneous Local metric Dimension problem (SLD) is NP-complete for families of $( 2 q + 1 , t )$-tadpoles.
Proof.
As we discussed previously, determining whether a vertex set $S ⊆ V$, $| S | ≤ p$, is a simultaneous local metric generator for a graph family $G$ can be done in polynomial time, so SLD is in NP.
Now, we will show a polynomial time transformation of HSP into SLD. Let $S = { v 1 , v 2 , … , v n }$ be a finite set, and let $C = { C 1 , C 2 , … , C k }$, where every $C i ∈ C$ satisfies $C i ⊆ S$. Let p be a positive integer such that $p ≤ | S |$. Let $A = { w 1 , w 2 , … , w k }$ such that $A ∩ S = ∅$. We construct the family $T = { T 2 q 1 + 1 , t 1 , T 2 q 2 + 1 , t 2 , … , T 2 q k + 1 , t k }$ composed by $( 2 q + 1 , t )$-tadpoles on the common vertex set $V = S ∪ A ∪ { u }$, $u ∉ S ∪ A$, by performing one of the two following actions, as appropriate, for every $r ∈ { 1 , … , k }$:
• If $| C r |$ is even, let $C 2 q r + 1$ be a cycle graph on the vertices of $C r ∪ { u }$; let $P t r$ be a path graph on the vertices of $( S − C r ) ∪ A$; and let $T 2 q r + 1 , t r$ be the tadpole graph obtained from $C 2 q r + 1$ and $P t r$ by joining with an edge a leaf of $P t r$ to a vertex of $C 2 q r + 1$ different from u.
• If $| C r |$ is odd, let $C 2 q r + 1$ be a cycle graph on the vertices of $C r ∪ { u , w r }$; let $P t r$ be a path graph on the vertices of $( S − C r ) ∪ ( A − { w r } )$; and let $T 2 q r + 1 , t r$ be the tadpole graph obtained from $C 2 q r + 1$ and $P t r$ by joining with an edge the vertex $w r$ to a leaf of $P t r$.
Figure 4 shows an example of this construction.
In order to prove the validity of this transformation, we claim that there exists a subset $S ″ ⊆ S$ of cardinality $| S ″ | ≤ p$ that contains at least one element from each $C r ∈ C$ if and only if $Sd l ( T ) ≤ p + 1$.
To prove this claim, first assume that there exists a set $S ″ ⊆ S$, which contains at least one element from each $C r ∈ C$ and satisfies $| S ″ | ≤ p$. Recall that any set composed by two vertices of $C 2 q r + 1$ is a local metric generator for $T 2 q r + 1 , t r$, so $S ″ ∪ { u }$ is a simultaneous local metric generator for $T$. Thus, $Sd l ( T ) ≤ p + 1$.
Now, assume that $Sd l ( T ) ≤ p + 1$, and let W be a simultaneous local metric generator for $T$ such that $| W | = p + 1$. For every $T 2 q r + 1 , t r ∈ T$, we have that $u ∈ V ( C 2 q r + 1 )$ and $δ T 2 q r + 1 , t r ( u ) = 2$, so $| ( W − { x } ) ∪ { u } ∩ V ( C 2 q r + 1 ) | ≥ | W ∩ V ( C 2 q r + 1 ) |$ for any $x ∈ W$. As a consequence, if $u ∉ W$, any set $( W − { x } ) ∪ { u }$, $x ∈ W$, is also a simultaneous local metric generator for $T$, so we can assume that $u ∈ W$. Moreover, applying an analogous reasoning for every set $C r ∈ C$ such that $W ∩ C r = ∅$, we have that, firstly, there is at least one vertex $v r i ∈ C r$ such that $v r i ∈ V ( C 2 q r + 1 ) − { u }$ and $δ T 2 q r + 1 , t r ( v r i ) = 2$, and secondly, there is at least one vertex $x r ∈ W ∩ ( { w r } ∪ V ( P t r ) )$, which can be replaced by $v r i$. Then, the set:
$W ′ = ⋃ W ∩ C r = ∅ ( W − { x r } ) ∪ { v r i }$
is also a simultaneous local metric generator for $T$ of cardinality $| W ′ | = p + 1$ such that $u ∈ W ′$ and $( W ′ − { u } ) ∩ C r ≠ ∅$ for every $C r ∈ C$. Thus, the set $S ″ = W ′ − { u }$ satisfies $| S ″ | ≤ p$ and contains at least one element from each $C r ∈ C$.
To conclude our proof, it is simple to verify that the transformation of HSP into SLD described above can be done in polynomial time. ☐

## 7. Conclusions

In this paper we introduced the notion of simultaneous local dimension of graph families. We studied the properties of this new parameter in order to obtain its exact value, or sharp bounds, on several graph families. In particular, we focused on families obtained as the result of small changes in an initial graph and families composed by graphs obtained through well-known operations such as the corona and lexicographic products, as well as the join operation (viewed as a particular case of the lexicographic product). Finally, we analysed the computational complexity of the new problem, and showed that computing the simultaneous local metric dimension is computationally difficult even for families composed by graphs whose (individual) local metric dimensions are constant and well known.

## Author Contributions

The results presented in this paper were obtained as a result of collective work sessions involving all authors. The process was organized and led by Juan A. Rodríguez-Velázquez and the writing of the final version of the paper was conducted by Juan A. Rodríguez-Velázquez and Yunior Ramírez-Cruz.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Blumenthal, L.M. Theory and Applications of Distance Geometry; Oxford University Press: Oxford, UK, 1953. [Google Scholar]
2. Slater, P.J. Leaves of trees. Congr. Numer. 1975, 14, 549–559. [Google Scholar]
3. Harary, F.; Melter, R.A. On the metric dimension of a graph. Ars Comb. 1976, 2, 191–195. [Google Scholar]
4. Khuller, S.; Raghavachari, B.; Rosenfeld, A. Landmarks in graphs. Discret. Appl. Math. 1996, 70, 217–229. [Google Scholar] [CrossRef]
5. Johnson, M. Structure-activity maps for visualizing the graph variables arising in drug design. J. Biopharm. Stat. 1993, 3, 203–236. [Google Scholar] [CrossRef] [PubMed]
6. Johnson, M. Browsable structure-activity datasets. In Advances in Molecular Similarity; Carbó-Dorca, R., Mezey, P., Eds.; JAI Press Inc.: Stamford, CT, USA, 1998; Chapter 8; pp. 153–170. [Google Scholar]
7. Melter, R.A.; Tomescu, I. Metric bases in digital geometry. Comput. Vis. Graph. Image Process. 1984, 25, 113–121. [Google Scholar] [CrossRef]
8. Chartrand, G.; Eroh, L.; Johnson, M.A.; Oellermann, O.R. Resolvability in graphs and the metric dimension of a graph. Discret. Appl. Math. 2000, 105, 99–113. [Google Scholar] [CrossRef]
9. SebŐ, A.; Tannier, E. On metric generators of graphs. Math. Oper. Res. 2004, 29, 383–393. [Google Scholar] [CrossRef]
10. Saenpholphat, V.; Zhang, P. Conditional resolvability in graphs: A survey. Int. J. Math. Math. Sci. 2004, 2004, 1997–2017. [Google Scholar] [CrossRef]
11. Hernando, C.; Mora, M.; Pelayo, I.M.; Seara, C.; Cáceres, J.; Puertas, M.L. On the metric dimension of some families of graphs. Electron. Notes Discret. Math. 2005, 22, 129–133. [Google Scholar] [CrossRef]
12. Haynes, T.W.; Henning, M.A.; Howard, J. Locating and total dominating sets in trees. Discret. Appl. Math. 2006, 154, 1293–1300. [Google Scholar] [CrossRef]
13. Cáceres, J.; Hernando, C.; Mora, M.; Pelayo, I.M.; Puertas, M.L.; Seara, C.; Wood, D.R. On the metric dimension of Cartesian product of graphs. SIAM J. Discret. Math. 2007, 21, 423–441. [Google Scholar] [CrossRef]
14. Yero, I.G.; Kuziak, D.; Rodríguez-Velázquez, J.A. On the metric dimension of corona product graphs. Comput. Math. Appl. 2011, 61, 2793–2798. [Google Scholar] [CrossRef]
15. Bailey, R.F.; Meagher, K. On the metric dimension of grassmann graphs. Discret. Math. Theor. Comput. Sci. 2011, 13, 97–104. [Google Scholar]
16. Jannesari, M.; Omoomi, B. The metric dimension of the lexicographic product of graphs. Discret. Math. 2012, 312, 3349–3356. [Google Scholar] [CrossRef]
17. Feng, M.; Wang, K. On the metric dimension of bilinear forms graphs. Discret. Math. 2012, 312, 1266–1268. [Google Scholar] [CrossRef]
18. Guo, J.; Wang, K.; Li, F. Metric dimension of some distance-regular graphs. J. Comb. Optim. 2013, 26, 190–197. [Google Scholar] [CrossRef]
19. Imran, M.; Bokhary, S.A.U.H.; Ahmad, A.; Semaničová-Feňovčíková, A. On classes of regular graphs with constant metric dimension. Acta Math. Sci. 2013, 33, 187–206. [Google Scholar] [CrossRef]
20. Saputro, S.; Simanjuntak, R.; Uttunggadewa, S.; Assiyatun, H.; Baskoro, E.; Salman, A.; Bača, M. The metric dimension of the lexicographic product of graphs. Discret. Math. 2013, 313, 1045–1051. [Google Scholar] [CrossRef]
21. Okamoto, F.; Phinezy, B.; Zhang, P. The local metric dimension of a graph. Math. Bohem. 2010, 135, 239–255. [Google Scholar]
22. Ramírez-Cruz, Y.; Oellermann, O.R.; Rodríguez-Velázquez, J.A. The simultaneous metric dimension of graph families. Discret. Appl. Math. 2016, 198, 241–250. [Google Scholar] [CrossRef]
23. Fernau, H.; Rodríguez-Velázquez, J.A. On the (Adjacency) Metric Dimension of Corona and Strong Product Graphs and Their Local Variants: Combinatorial and Computational Results (arXiv:1309.2275). Available online: https://arxiv.org/abs/1309.2275 (accessed on 26 July 2017).
24. Rodríguez-Velázquez, J.A.; Barragán-Ramírez, G.A.; García Gómez, C. On the local metric dimension of corona product graphs. Bull. Malays. Math. Sci. Soc. 2016, 39 (Suppl. 1), S157–S173. [Google Scholar] [CrossRef]
25. Fernau, H.; Rodríguez-Velázquez, J.A. Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results; Springer International Publishing: Cham, Switzerland, 2014; pp. 153–166. [Google Scholar]
26. Hammack, R.; Imrich, W.; Klavžar, S. Handbook of Product Graphs, 2nd ed.; CRC Press: Boca Raton, FL, USA, 2011. [Google Scholar]
27. Imrich, W.; Klavžar, S. Product Graphs, Structure and Recognition; Wiley: New York, NY, USA, 2000. [Google Scholar]
28. Koh, K.M.; Rogers, D.G.; Teo, H.K.; Yap, K.Y. Graceful graphs: Some further results and problems. Congr. Numer. 1980, 29, 559–571. [Google Scholar]
29. Karp, R. Reducibility among combinatorial problems. In Complexity of Computer Computations; Miller, R., Thatcher, J., Eds.; Plenum Press: New York, NY, USA, 1972; pp. 85–103. [Google Scholar]
Figure 1. The set ${ v 3 , v 4 }$ is a simultaneous local metric basis of ${ G 1 , G 2 , G 3 }$. Thus, $Sd l ( G 1 , G 2 , G 3 ) = 2$.
Figure 1. The set ${ v 3 , v 4 }$ is a simultaneous local metric basis of ${ G 1 , G 2 , G 3 }$. Thus, $Sd l ( G 1 , G 2 , G 3 ) = 2$.
Figure 2. The family $G = { G 1 , … , G 6 }$ satisfies $Sd l ( G ) = | V | − 1 = 3$.
Figure 2. The family $G = { G 1 , … , G 6 }$ satisfies $Sd l ( G ) = | V | − 1 = 3$.
Figure 3. The family $G = { G 1 , G 2 }$ satisfies $Sd l ( G ) = dim l ( G 1 ) + dim l ( G 2 ) = 4$.
Figure 3. The family $G = { G 1 , G 2 }$ satisfies $Sd l ( G ) = dim l ( G 1 ) + dim l ( G 2 ) = 4$.
Figure 4. The family $T = { T 5 , 4 ( 1 ) , T 3 , 6 ( 2 ) , T 5 , 4 ( 3 ) }$ is constructed for transforming an instance of the Hitting Set Problem (HSP), where $S = { v 1 , v 2 , v 3 , v 4 , v 5 }$ and $C = { { v 1 , v 2 , v 3 , v 4 } , { v 3 , v 5 } , { v 2 , v 4 , v 5 } }$, into an instance of Simultaneous Local metric Dimension (SLD) for families of $( 2 q + 1 , t )$-tadpoles.
Figure 4. The family $T = { T 5 , 4 ( 1 ) , T 3 , 6 ( 2 ) , T 5 , 4 ( 3 ) }$ is constructed for transforming an instance of the Hitting Set Problem (HSP), where $S = { v 1 , v 2 , v 3 , v 4 , v 5 }$ and $C = { { v 1 , v 2 , v 3 , v 4 } , { v 3 , v 5 } , { v 2 , v 4 , v 5 } }$, into an instance of Simultaneous Local metric Dimension (SLD) for families of $( 2 q + 1 , t )$-tadpoles.