On the Metric Dimension of Generalized Tensor Product of Interval with Paths and Cycles

&e concept of minimum resolving set for a connected graph has played a vital role in Robotic navigation, networking, and in computer sciences. In this article, we investigate the values ofm and n for which (P2 ⊗)Pn and (P2 ⊗)Cn are connected and find metric dimension in this case.We also conclude that, for eachm, we obtain a new regular family of constant metric dimension.We also give a basis for these graphs and presentation of resolving vector in general closed form with respect to the basis.


Introduction
e concept of metric dimension and resolving sets were initially drafted for the metric spaces in 1953 in [1], p. 95 but did not receive much attention because of the linear continuum nature of standard Euclidean spaces R n . Later, Slater in [2,3] and Harary and Melter in [4] used these ideas of uniquely determining the location of an intruder in a network and graphs.
is idea also paved the way for searching uniquely the receiver of a message on a network. Since then the resolving sets have been widely investigated, see, for instance, [5,6]. e resolving sets also have useful applications in diverse areas including network discovery and verification [7], strategies for the mastermind games [8], and applications to problems of pattern recognition, image processing, and digital geometry [5]. Chartrand et al. discussed resolvability and its connection with metric dimension of graphs in [9,10]. Similarly, on another node, a real-world problem is the study of networks which is not centrally controlled but rather distributed. So, it becomes relatively difficult and costly to obtain a map of all nodes and the links between them. One possible solution is to view network from various local positions and combine them to obtain a good approximation for the real network, [11]. Metric dimension has some applications in this respect as well. Buczkowski et al. discussed a general idea of k-dimensional graphs [12]. First, we introduce general terminology related to a graph.
A graph G is an ordered pair (V, E), where V is the vertex set and E is the edge. e distance between vertices v, w ∈ V, denoted by d (v, w), is defined as the length of the shortest path between v and w, and the diameter of G, denoted by dia(G), is defined as the maximum distance among all pairs of vertices in G.
A resolving set W of G with the least cardinality is called metric basis of G, and this cardinality is the called metric dimension of G denoted by β(G). It is a common fact now that β is unique although we may have many metric bases. Actually the choice of a particular matric basis leads us towards the unique coordinate representation of all vertices of a graph. For an ordered subset W � w 1 , w 2 , . . . , w n of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple.
A lot of work has already been carried out on computation of metric dimension and its other variants related ideas of graphs. Buczkowski et al. [12] calculated the dimension of wheel W n and arrived at the result that dim(W n � ((2n + 2)/5)) for n ≥ 7. Caceres et al. [13] computed the dimension of fan graphs, f n , and proved that, for n ≥ 7, dim(f n ) � ((2n + 2)/5). Tomescu and Javaid proved that the dimension of Jahangir graphs J 2n to be dim(J 2n ) � (2n/3) for n ≥ 4 [14]. Imran et al. computed the dimension of circulant graphs in [15]. Hussain et al. computed bounds for the metric and partition dimension of generalized Mobius ladders in [16].
In the abovementioned cases, metric dimension of all graphs depends upon the number of vertices in the graph. In contrast, one is interested in the list of all families of graphs in which metric dimension remains constant which seems to be an important feature of the family. Authors in [17,18] discussed some families of graphs with constant metric dimension. Another aspect is the metric dimension of a graph that is some kind of product of two other graphs. One is often interested in relating the dimension of the product graphs with dimensions of the component graphs. Cartesian product of two graphs G and H, denoted by G□H is a graph such that the vertex set of G□H is the Cartesian product V(G) × V(H) as a set, and any two vertices (u, u ′ ) and e metric dimension of the Cartesian products of graphs has been studied in [19]. Authors proved that the metric dimension of G□G is tied in a strong sense to the minimum order of a so-called doubly resolving set in G. Authors also computed bounds on G□H for many examples of G and H. Authors in [20] recursively defined generalized corona product and derived some important results about this product in terms of the dimension of components involved, whereas, in [21], authors computed strong metric dimension of this corona product. Another product is the tensor product, G ⊗ H of graphs G and H which is a graph such that the vertex set of G ⊗ H is the Cartesian product V(G) ⊗ V(H); any two vertices (u, u ′ ) and (v, v ′ ) are adjacent in G ⊗ H if and only if u ′ is adjacent with v ′ and u is adjacent with v. For example, the tensor product of P 2 with Moradi discussed the tensor product of some graphs in [22]. Jannesari and Omoomi computed metric dimension of lexicographic product of some graphs by introducing a new parameter known as adjacency dimension, [23]. Saputro et al. further extended these results for other graphs in [24]. Javaid et al. computed metric dimension of co-normal product of graphs in [25].
In this paper, we discuss n-copies of tensor product of P 2 with P n and C n . is type of product is relatively less studied in the literature as compared to the Cartesian product. In the first stage, we decide about the connectedness of this product. At the second step, we compute the metric dimension of the connected graphs among them. We like to remark that metric dimension of the tensor product of two graphs has not been extensively studied over the years.

Main Results
We focus first on P 2 ⊗ m P n . We compute minimal resolving set for it allowing ∞ as distance between two vertices when there does not exist any path connecting them so they are in different components of a graph. e interesting question is the value of m for which the graph (P 2 ⊗ m )P n is connected. e answer, however, is no in this case. Existence of ∞ as any component of resolving vector clearly indicates that the graph is disconnected. Although we cannot talk about the metric dimensions in these cases but cardinality of minimum removability does make sense as it shows the connectedness of a graph. We actually give the closed representation of all vertices with respect to our selected metric basis in each case.

Theorem 1
(i) ∀ m and n ≥ 2, (P 2 ⊗ m )P n is disconnected (ii) Cardinality of the minimal resolving set is 2 m vertices P n and v j,k is the vertex of P 2 of Kth component. We show that W is a resolving set. For this, we give the representation of any vertex of V(P 2 ⊗ m P n ) with respect to W: 2

Journal of Mathematics
Now, we consider the minimality of the resolving set. If we delete (u 1,1 , u 1,2 , . . . , u 1,m , v 1 ) from W, then r ((w 1 , u 1,1 , . . . , Now, we turn our attention to the P 2 ⊗ m C n . In contrast to the above result, we have an interesting result here. For m � 1 and n ≡ 1(mod2), our graph is connected. Moreover, we also give metric dimension in this case as well.
where (v k ) are vertices of P 2 and (u 1 ) and (u 2 ) are adjacent vertices of C n . We show that W is a resolving set. For this, we give the representation of any vertex of V(P 2 ⊗ C n )| W with respect to W: We see that all the representations are distinct, implying that dim(P 2 ⊗ C n ) � 2. Now, we prove that W is a minimal resolving set. If we take W � (u 1 , v 1 ) , we receive two similar resolving vectors: (2) Case 1 (when n is odd): we compute the general form of resolving vector in this case.
Let W � (u i , v j,1 , v j,2 , . . . , v j,m ) , where v k are vertices of P 2 and (u t ) and (u 2 ) are vertices of C n . We show that W is a resolving set. For this, we give the representation of any vertex of V(P 2 ⊗ m C 2k+1 ) with respect to W:
Case 2 (when n is even): let W � (u i , v j,1 , v j,2 , . . . , v j,m ) . We show that W is a resolving set. For this, we give the representation of any vertex of V(P 2 ⊗ m C 2k ) with respect to W.
(3) From the above resolving pattern, we can argue this result by presence of ∞ at any place.

Remark 2.
e same result can be proved by [22] by the agreement that the tensor product of two graphs is disconnected when both factors are bipartite and connected.

Conclusions
In the end, we like to summarize our main outcomes. First, noticeable point is the disconnectedness of all P 2 ⊗ m P n . e sum and substance of this article is the connectedness of P 2 ⊗ m C n for m � 1 and n ≡ 1(mod2) and metric dimension in this case is 2. So, we obtain a regular family of graph with constant metric dimension 2, which is decomposable into paths and cycles. From network point of view, only this family is significant. However, for the remaining families, we can find minimum resolving set and its cardinality. We conclude this article with β P 2 ⊗ m C n � 2 m , if n is odd,

Data Availability
No data were used to support the findings of the study.

Conflicts of Interest
e authors declare that they have no conflicts of interest.