Resolving set and exchange property in nanotube

: Give us a linked graph, G = ( V , E ) . A vertex w ∈ V distinguishes between two components (vertices and edges) x , y ∈ E ∪ V if d G ( w , x ) (cid:44) d G ( w , y ) . Let W 1 and W 2 be two resolving sets and W 1 (cid:44) W 2 . Then, we can say that the graph G has double resolving set. A nanotube derived from an quadrilateral-octagonal grid belongs to essential and extensively studied compounds in materials science. Nano-structures are very important due to their thickness. In this article, we have discussed the metric dimension of the graphs of nanotubes derived from the quadrilateral-octagonal grid. We proved that the generalized nanotube derived from quadrilateral-octagonal grid have three metric dimension. We also check that the exchange property is also held for this structure.


Introduction
Chemical graph theory allows for the discussion of chemical structures and mathematical molecular representations.The structural characteristics of crystals, processes, clusters, molecules, polymers and other materials are described using chemical graph theory.Recent advances and discoveries of mathematical models of chemical circumstance and the application of mathematical techniques and concepts to chemistry have led to the development of mathematical chemistry with a wide range of perspectives to deal with chemical structures that support existing chemical concepts [1].Very large and complex chemical structures in their original form are not easy for understanding, and chemical graph theory is used to make them simple and understandable.
A nanotube derived from an quadrilateral-octagonal grid belongs to essential and extensively studied compounds in materials science [2][3][4].Nanostructures have many applications due to their thickness, such as those used in the medical field and nanotechnology.We resolve these structures and find mixed metric dimensions [5].For further discussion of mathematical chemistry related to graph theory, see [6,7].
Let the distance be denoted by ξ and a vertex k is resolved to a pair of p, q vertices if the distances from k to p and q satisfy ξ(k, p) ξ(k, q).Let W 1 and W 2 be two resolving sets and W 1 W 2 .Then, we can say that the graph G has double resolving set.The resolving or locating set recognizes a unique representation of the chemical structures [8].The smallest cardinality of the resolving set is called the metric dimension [9][10][11].The notion of the locating set of a graph was introduced by [12] in 1975.The same notion was introduced by [13] in 1976, which they called the metric dimension of a graph.The concept of the revolving set and the metric dimension Blumenthal had long ago been described in his monograph theory in the general context of metric space and the applications of distance geometry [14,15].
When W 1 and W 2 are any two minimal resolving sets for G and each vertex u in W 1 has a vertex v ∈ W 2 , then \{u})∪v is also a minimal resolving set.Resolving sets are afterward said to possess the exchange property in the graph (for details see [16].In this study, only finite, simple, and linked graphs are taken into consideration.Additionally, every group that is taken into consideration is finite.A graph's exchange property also refers to its set resolution property.
In chemistry, the double-resolving set has several applications, and the double-resolving set of different chemical structures was studied in various articles.Double resolving set of Jellyfish Graph and Cocktail Party Graph are studied in [35], Computing minimal doubly resolving sets of graphs are discussed in [36], Minimal doubly resolving sets of prism graphs are studied in [37].The mixed metric dimension and a resolving set of silicate stars discussed in [38], metric dimension's upper bonds of cellulose networks determined in [39], metric dimension of crystal cubic carbon structure determined in [40], discussion about Convex polytopes graph was given in [41], edge metric dimension of Cayley graphs barycentric subdivision was done in [42], due to its variety, many difficult problems are solved by applying the concept of metric dimension.For resolvability parameters of various chemical structures, we refer to [43][44][45].
For more physical and chemical properties of the quadrilateral-octagonal grids, we refer to see [46][47][48].Some basic mathematical definitions of distance, resolving set and metric dimension are given below that are used in this article.Definition 1.1.Let G be the simple, undirected graph in which set of vertices are represented by V(G) and set of edges denoted by E(G), the distance which is also known as geodesics between β 1 , β 2 ∈ V(G) two vertices is the length of the smallest path between Definition 1.2.Consider V(G) is the order set of vertices labeled as L = {β 1 , β 2 , β 3 , . . ., β h } and β ∈ V(G).The representation r(β|L)of β-vertex concerning order subset L is the h-tuple distances (ξ((β, β 1 ), (β, β 2 ), (β, β 3 ), (β, β 4 ), . . ., (β, β h ).If the representation shown by each vertex of G is unique according to L, then L is known as the resolving set of G, the smallest cardinality of L is the metric dimension, and it is denoted by dim(G).Some basic theorems are used in this article.In [49] the author prove that dim(G) = 1 if and only if G = P n , and in [13] it is proved that dim(C n ) = 2, for n ≥ 3 where the C n is a cycle graph.The mixed metric dimension one is also for the path graph.
Theorem 1.1.Let NT h,v be a nanotube with h, v ≥ 1.Then double resolving sets of cardinality 3 exist.Proof.To prove this claim we have to show that the nanotube has two resolving sets of cardinality 3. Let W 1 and W 2 be two resolving sets of nanotube such that R 1 R 2 .In Figure 1, red is used for those edges that have endpoints of degree 2 and 3.The blue color is used for those edges that have endpoints of degree 2 and the black color is used for all edges that have endpoints of degree 3. The green color is used for 2-degree vertex and the black color vertex has a degree 3. The double color is used for that vertex which makes a revolving set.a 1,1 is black and red due to the degree of 3 and the point of resolving set.Vertices a 1,3 ,b v,2 are green and red due to degree 2 and point of resolving set.Suppose h and v denote the horizontal and vertical number of C 8 .The 2 degree vertices are 2h, and vertices of degree 3 are 8hv − 2h.The order of NT h,v is |O(NT h,v )| = 8hv and the size of

Construction of nanotube NT
Two parameters h, v and tow index m, nare used in labelling.m vary two times with v and n change 4 time with h.The vertex and edge sets of the nanotube are resp.
Carbon nanotube production exceeded several thousand tons per year, used for applications in automotive parts, molecular electronics, catalyst supports, energy storage, boat hulls, device modeling, biomedical, air and water filtration, sporting goods, thin-film electronics, water filters, actuators, coatings and electromagnetic shields.Over three decades, carbon nanotubes have been used in important applications, such as microelectronic circuitry and microscopy, as well as devices designed to model biological systems and probe quantum mechanics.The two types of carbon nanotubes are single-wall carbon nanotubes and multi-wall carbon nanotubes.Carbon nanotube has multiple properties like strength and elasticity, electrical conductivity, electron emission, aspect ratio, thermal conductivity and expansion.Some researchers find the topological indices of this nanotube and many other people work on nanotubes in fluid flow but in the research area of graph theory.Our aim in this section is to determine the metric dimension of this nanotube.However, first we will construct the nanotube derived from an quadrilateral-octagonal grid and we will denote it by NT h,v .
Theorem 2.1.Let NT h,v be a nanotube with h, v ≥ 1.Then W 1 is minimal resolving set of cardinality 3.
}, be a subset of the vertices of NT h,v .To prove that W 1 is a minimal resolving set of cardinality 3 we follow the definition of resolving set.Given below are the unique representation of all vertices of NT h,v for h, v ≥ 1 (See Figure 2).
Table 1.Representation of vertices of Figure 2.
This is a unique representation of vertices of nanotube for h=1=v.
Conversely, for dim Dimension 1 is not possible because that is only for the path graph.Now for the dimension is not 2 we discuss some cases.Consonantly, there is no possibility of the above collection which are |v| G 2 = |v|!2!(|v|−2)!= 8(hv)!2!(8(hv)−2)! of vertex set of NT h,v .This shows that locating or resolving a set of 2-cardinality does not have a unique representation, so a minimal resolving set of 2 cardinalities is impossible.Hence the minimal resolving set has cardinality of 3.

Construction of nanotube NT h,v for resolving set W 2
In Figure 3, red is used for those edges that have endpoints of degree 2 and 3.The blue color is used for those edges with endpoints of degree 2 and the black color is used for all edges that have endpoints of degree 3. The green color is used for 2-degree vertex and the black color vertex has a degree 3. The double color is used for those vertexes which make a resolving set.b 1,1 is black and red color due to the degree 3 and the point of resolving set.a 1,3 ,b V,3 are green and red due to degree 2 and point of resolving set.suppose h and v denotes the horizontal and vertical number of C 8 .The 2 degree vertices are 2h, and the number of vertices of degree 3 are 8hv − 2h.The order of NT h,v is |O(NT h,v )| = 8hv and the size of Theorem 3.1.Let NT h,v be a nanotube with h, v ≥ 1.Then W 2 is also an other resolving set of cardinality 3.
Proof.Let W 2 = {b 1,1 , a 1,3 , b v,3 }, be a subset of the vertices of NT h,v .To prove that W 2 is a minimal resolving set of cardinality 3 we follow the definition of resolving set.Given below are the unique representation of all vertices of NT h,v for h, v ≥ 1 (See Figure 4).
Table 2. Representation of vertices of Figure 4.
This is a unique representation of vertices of nanotube for h=1=v.

Generalized results
The generalized formulas of distances of all vertices of the quadrilateral-octagonal nanosheet show that the minimal resolving set has cardinality 2 because all distances are different.Given below are the generalized formulas of distances.Let for n ≤ 4m − 7, 0 otherwise, for Z + 0 otherwise, where for n ≥ 2h + 4, 0 otherwise, for n ≤ 2h, 0 otherwise, for n ≥ 3, 0 otherwise, Let p and q be two any arbitrary vertices on nanotube NT h,v .Let W 2 = {b 1,1 , a 1,3 , b v,2 }.Case I: When p = b m,n and q = b m ,n then further three Subcases arise.Subcase 1: if m = m , n n and without loss of generality we can say that n Subcase 2: if m m , n = n and without loss of generality we can say that m < m then ξ(p, a 1,3 ) ξ(q, a 1,3 ) Because ξ(p, a 1,3 ) = ξ(q, a 1,3 ) + s where s = 2(m − m) so r(p | W 2 ) r(q | W 2 ).Subcase 3: if m m , n n and without loss of generality we can say that n Case II: When p = a m,n and q = a m ,n .Subcase 1: if m = m , n n and without loss of generality we can say that n < n then ξ(p, b 1,1 ) Subcase 2: if m m , n = n and without loss of generality we can say that m < m then ξ(p, a 1,3 ) ξ(q, a 1,3 ) Because ξ(p, a 1,3 ) = ξ(q, a 1,3 ) + s where s = 2(m − m) so r(p | W 2 ) r(q | W 2 ).Subcase 3: if m m , n n and without loss of generality we can say that n Case III: When p = b m,n and q = b m ,n then further four Subcases arise.
We discuss all cases in which ξ(p, b 1,1 ) ξ(q, b 1,1 ) whatever ξ(p, No possibility shows two representations are equal.From the above discussion in the form of representation, we note that unique representation is given by all the vertex and satisfies the condition of resolving set which shows that |W 2 | = 3. Conversely, for dim e (NT h,v ) ≥ 3 ∼ dim e (NT h,v ) < 3 ⇒ dim e (NT h,v ) = 1 or 2. Dimension 1 is not possible because that is only for the path graph.Now for the dimension is not 2 we discuss some cases.Consonantly, there is no possibility of the above collection which are |v| G 2 = |v|!2!(|v|−2)!= 8(hv)!2!(8(hv)−2)! of vertex set of NT h,v .This shows that locating or resolving a set of 2-cardinality does not have a unique representation, so a minimal resolving set of 2 cardinality is impossible.so the minimal resolving set has cardinality of 3. Hence prove that W 2 ia an other resolving set of nanotube has cardinality 3.

Exchange property
In graph theory, a resolving set of a graph is a subset of vertices that uniquely identifies every vertex in the graph.More formally, a resolving set S of a graph G is a subset of vertices such that for every pair of distinct vertices u and v, there exists a vertex w in S such that the distance from u to w is different from the distance from v to w.
The exchange property of a resolving set refers to a property that allows one to exchange vertices between resolving sets in a graph without losing the resolving property.Specifically, if S and T are two resolving sets of a graph G, and there exists a vertex v in S \ T (S minus T) such that (T v) ∪ u is also a resolving set for every vertex u in S \ T, then we say that the resolving sets S and T have the exchange property.
In other words, the exchange property means that if there is a vertex in one resolving set that is not in the other resolving set, but by removing it from the first and adding a vertex from the second, we still obtain a resolving set.This property allows us to manipulate and transform resolving sets while maintaining their essential property of uniquely identifying every vertex in the graph.
The exchange property is useful in various applications of resolving sets, such as graph reconstruction, fault diagnosis and network localization.It allows for the efficient construction and modification of resolving sets, enabling better analysis and understanding of graph structures.
Note that not all resolving sets have the exchange property.The exchange property is a desirable characteristic but is not a necessary condition for a set to be a resolving set.There may be resolving sets that do not satisfy the exchange property.
The components of a vector space's basis determine each vector in a finite-dimensional space in a unique way (expressed as a linear combination).The exchange property applies to a vector space's basis.The vertices of a minimal resolving set can also be used to uniquely identify each vertex of a finite graph.As a result, resolving sets of a finite graph behave like bases in a vector space with finite dimensions.The exchange property is not always present in the minimal resolving sets, unlike a linear basis of a vector space.The literature contains findings regarding the exchange property for various graphs.For instance, the exchange property is true for resolving sets in trees, but it is false for n ≥8 in wheels graph W n .Theorem 4.1.Let NT h,v be an quadrilateral-octagonal Nanotube with h, v ≥ 1 then exchange property hold for this structure.Now to prove this claim we follow the definition of the exchange property.Let u = a 1,1 and u∈ W 1 , v = b 1,1 and v ∈ W 2 then (W 1 \{u})∪v is also a minimal resolving set.Suppose (W 1 \{u})∪v = K Now we have to prove that K is also a minimal resolving set for NT h,v .We know that W and in theorem 4.1 we prove that W 2 is a minimal resolving set of cardinality 3. Hence prove that the exchange property hold in NT h,v .a 1,3 andb v,3 are common point in W 1 and W 2 .So W 1 , W 2 exchange u and v point with each other.

Conclusions
This article discusses two structures of nanotubes derived from the quadrilateral-octagonal grid.We have found the resolving sets of the nanotubes based on the distance of the graph.The Resolving sets of nanotubes are cardinality 3.Moreover, we found that when a nanosheet folds and makes a nanotube, the 2D structure converts into 3D.Due to this phenomenon, the cardinality of resolving sets increases one.We ensure that the exchange property is also held for this structure.

Implications, limitations
The metric dimension in graph theory refers to the minimum number of vertices required to uniquely identify every vertex in a graph.While it is a well-studied concept with various applications, there are certain limitations and potential future directions to consider.
Computational Complexity: Computing the exact metric dimension of a graph is known to be NPhard, which means that there is no known efficient algorithm to solve it in general.The problem becomes even more challenging for larger graphs, limiting its applicability in practical scenarios.Thus, developing approximation algorithms or finding efficient algorithms for special graph classes are areas of interest.
Lack of Structural Understanding: The metric dimension does not always provide insight into the structural properties of a graph.Even graphs with the same metric dimension can exhibit different structural characteristics.Understanding the relationship between the metric dimension and other graph parameters, such as connectivity, diameter or degree distribution, is an avenue for further research.
Dynamic Graphs: Most studies on metric dimension assume static graphs, where the underlying structure does not change.However, in real-world scenarios, graphs often evolve dynamically.Exploring the metric dimension in dynamic graphs, where edges and vertices are added or removed over time, is an important direction for future research.
Robustness and Fault-Tolerance: Analyzing the resilience of metric dimension under vertex or edge failures is another interesting aspect.Investigating how the metric dimension changes in the presence of faults or attacks can provide insights into the fault-tolerance and robustness of networks.
Application-Specific Metrics: Different applications may require tailored metrics for vertex identification.Developing and studying alternative measures that capture specific characteristics of graphs in different contexts can be valuable.For instance, considering weighted or probabilistic graphs, where vertices have different importance or uncertainties, can lead to novel perspectives on metric dimension.
Beyond Traditional Graphs: Exploring the metric dimension in non-traditional graph structures, such as hypergraphs, temporal networks, or spatial networks, can provide new insights and challenges.These extended graph models require rethinking the notion of distance and vertex identification, pushing the boundaries of metric dimension research.
Overall, the limitations in the metric dimension topic present opportunities for further investigation and the development of new methodologies, algorithms and applications.By addressing these limitations, we can deepen our understanding of graph structures and expand the utility of metric dimension in diverse fields.For more work on the metric dimension, we refer to see [50][51][52].

Future study
In this draft, we did the computation of only resolving set and its exchange property.One can also consider to discuss the other variants of resolving set, like fault-tolerant resolving set [53][54][55], partition resolvability of these chemical compounds [56,57] and other similar theoretical parameters as well.

Definition 1 . 3 .
Let Let R m = {v 1 , v 2 } be a mixed metric resolving set then r(v | R m ) and r(e | R m ) should be unique and it is denoted by dim m (G).