On Sharp Bounds of Local Fractional Metric Dimension for Certain Symmetrical Algebraic Structure Graphs

The smallest set of vertices needed to differentiate or categorize every other vertex in a graph is referred to as the graph's metric dimension. Finding the class of graphs for a particular given metric dimension is an NP-hard problem. This concept has applications in many different domains, including graph theory, network architecture, and facility location problems. A graph $G$ with order $n$ is known as a Toeplitz graph over the subset $S$ of consecutive collections of integers from one to $n$, and two vertices will be adjacent to each other if their absolute difference is a member of $S$. A graph $G(\mathbb{Z}_{n})$ is called a zero-divisor graph over the zero divisors of a commutative ring $\mathbb{Z}_{n}$, in which two vertices will be adjacent to each other if their product will leave the remainder zero under modulo $n$. Since the local fractional metric dimension problem is NP-hard, it is computationally difficult to identify an optimal solution or to precisely determine the minimal size of a local resolving set; in the worst case, the process takes exponential time. Different upper bound sequences of local fractional metric dimension are suggested in this article, along with a comparison analysis for certain families of Toeplitz and zero-divisor graphs. Furthermore, we note that the analyzed local fractional metric dimension upper bounds fall into three metric families: constant, limited, and unbounded.


Introduction
Graphs are mathematical structures made up of vertices (nodes) and edges (connections) that are used to illustrate various relationships and links between objects or entities.The need to understand the structural qualities of graphs in terms of the labeling of their vertices and the connections between their nodes led to the development of the idea of metric dimension.Metric dimension has practical implications in network design, graph theory, and optimization [1][2][3].
By determining the minimum number of landmarks or reference points required to uniquely identify locations in a network, we can efficiently design routing protocols, establish communication schemes, and ensure a reliable information flow.Metric dimension also finds applications in facility location problems, where the goal is to identify the optimal locations for facilities to serve a given set of clients or demands.When one takes into account the metric dimension of a graph, we are able to strategically place our facilities so that we can serve all of our customers while keeping the overall cost and the amount of distance traveled to a minimum.The study of metric dimensions, in general, gives us the ability to measure and evaluate the spatial and structural interactions in graphs, which in turn leads to practical applications in network design, facility localization, sensor networks, graph theory, and the analysis of algorithmic complexity.

arXiv:2311.03147v1 [math.CO] 6 Nov 2023
Melter and Harary were the ones who originally suggested the idea of metric dimension [4].Within a network, vertices are denoted by nodes, and the connections that exist between the nodes are denoted by edges.This structure makes it possible for agents to travel from one vertex to another.To facilitate agent localization, certain points are designated as landmarks.The metric basis refers to the smallest set of landmarks, while the metric dimension represents the cardinality of this set [5].Building upon this foundation, Arumugam and Mathew have made significant advancements in the study of the fractional metric dimension (FMD) [6].Because of their efforts, our basic knowledge of FMD and its characteristics has significantly advanced.In addition, the use of FMD has been investigated in a variety of network topologies, such as lexicographic, hierarchical, Cartesian, corona, and corona-comb networks.These networks are explored utilizing FMD collected from product operations, which reveals helpful insights into the structural properties of the networks themselves [7].
The Fractional Metric Dimension (FMD) in modified Jahangir networks and permutational systems was researched by Wang and Feng [8,9], as well as by Liu et al. [10].They investigated the FMD's characteristics as well as various estimate methods while applying them to these network architectures.In addition, Raza et al. contributed further to the knowledge of FMD across multiple graph classes, while Aisyah et al. calculated the boundaries of FMD in metal-organic graphs [11,12].They recommended FMD to be used for the corona product of systems and proposed a more localized version of the metric dimension that they called the Local Fractional Metric Dimension (LFMD).Their research primarily focused on investigating the LFMD and its applications in a variety of graph compositions and formats.The researchers Liu et al. made significant contributions to the field of LFMD [13].More recent work was conducted by Ali, Falcón, and other researchers, who studied the LFMD of a collection of circular symmetric planar graphs.This research was carried out in order to investigate further the local fractional metric dimension [14].The graphs arise as a result of the merging of the edge of an order n cycle with the edges of n additional chorded cycles of the same order n.For more on the subject, see [15] and references therein.
The research carried out by Aisyah et al. contains one of the first known references to LFMD within the context of the corona product of systems [12].Within the corona product of graphs, the localized fractional metric dimension is taken into account by the LFMD.As a result, it is possible to obtain insights on the localized structure and labeling of vertices in this graph composition [16].The Corona technique, performed in 2016 by Rodríguez-Velázquez et al., introduces the idea of using local metric dimensions in graphs [17].In the same year, Marsidi et al. established the local metric dimensions for line graphs, as well as other different graphs [18].
If all the networks that make up a family, represented by F, have the same metric dimension within a collection of linked networks, then it is said that the family has a constant metric [19].Because a generalized Peterson anti-prism in a P(n, 2) network C is a circulant network C 2 n, each one of them also forms a family with a constant metric dimension.In the course of the inquiry, we also look at the size of wheels and Jahangir networks using metric systems and, with the help of Integer Programming, we acquire a response that is more specific to our idea.
FMD has a significant number of innovative features.For instance, FMD was also employed by Fehr et al. to produce a better solution to a linear programming relaxation [20].Afterward, Arumugam and Mathew's contributions helped to shed light on the subject [6].Moreover, several graph theorists reported a number of findings on the metric dimension and graph labeling on many families of graphs [14,21,22].Other researchers have studied FMD with respect to various other elements of graph theory [23][24][25][26][27].
Algebraic graph theory is a branch of mathematics that examines and evaluates graph characteristics and structures using algebraic methods.In the field of algebraic graph theory, various problems are still open.For example, the problem of the number of components of a graph, which depends on the modular relation, is still dealt with as a conjuncture.
There are several algebraic graphs based on the algebraic structure that have now been studied, and we refer the reader to [28][29][30] and references therein.Here, we discuss a zero-divisor graph that depends on the set of zero divisors of a ring R. A graph G is known as a zero-divisor graph whose vertex set is the zero divisors of modular ring Z n , and two vertices will be adjacent to each other if their product will be zero under mod n [31].The zero-divisor graph for n = 35 is shown in Figure 1.A graph G is called a Toeplitz graph if its vertex set is M = {1, 2, . . ., n} and two vertices p, q are adjacent to each other if their absolute difference belongs to S, where S ⊆ M (|p − q| ∈ S ⊆ M).The Toeplitz graph T 22 < S > for S = {1, 2, 21} is shown in Figure 2. A resolving function [6] of the graph G is any map for every pair of distinct vertices v, w ∈ V(G).The fractional metric dimension of the graph The concepts of local resolving neighborhood and local resolving function arise similarly, in the case of dealing with pairs of adjacent vertices only.Then, the local fractional metric dimension of the graph G is defined as Further, from now on, we denote ℓ(G) = min{|R{v, w}| : vw ∈ E(G)}.In particular, since v, w ∈ R{v, w}, for all v, w ∈ V(G), one has ℓ(G) ≥ 2. The next result follows from all the previous definitions.Lemma 1 and Theorem 1 have a vital importance throughout the manuscript.In particular, it will be used in the proofs of Theorems 2 to 8.
Lemma 1 ([12,32]).If G is any finite simple graph with order greater than n > 2, then and the local fractional metric dimension is one if, and only if, the graph G is a bipartite graph.
Theorem 1 ([33]).Let G be a simple graph with order n and R{e} be the local resolving neighborhood set.Then, n where Let us illustrate relation (2).The Toeplitz graph G = T 16 < {1, 4, 8} > is given in Figure 3. Since the minimum and maximum cardinalities of the resolving sets are 8 and 14, respectively, it follows by relation (2) and Theorem 1 that The article is arranged as follows.Section 2 recalls some applications of metric dimension in diverse fields such as navigation, networking, pattern recognition and image processing, combinatorial optimization, image programming, chemistry, and drug discovery.In Section 3, stream values of the LFMD of certain families of Toeplitz graphs are studied.Then, in Section 4, the LFMD for zero-divisor graphs over a zero divisor of Z n is computed while in Section 5, we compute it for zero-divisor graphs over Z n \ {0}.In Section 6, we give some remarks on finding LFMD for algebraic structure graphs.In Section 7, a few concluding remarks, directions for future work, and some open problems needing further research are discussed.

Survey of Applications of Metric Dimension
Metric dimension, a distance-based characteristic, is used to pinpoint the positions of things in space, such as machinery, robots, chemical compounds, etc.The objective is to minimize the number of locations or nodes that are used by these items, as well as to optimize time consumption and the shortest distances between destinations.Applications for metric dimension may be found in the following fields: • Navigation, to determine the metric dimension in robotics and navigation systems, to set up robots or machines most effectively for effective movement and path planning [34].
• Networking, where metric dimension is used to estimate the bare minimum of nodes required to uniquely identify the network [35].• Pattern Recognition and Image Processing, where metric dimension helps with tasks such as feature selection and pattern recognition by allowing data points to be represented in a lower-dimensional space while still retaining their key properties [15].

•
Combinatorial Optimization, to determine the most effective approach to cover or represent a collection of points in space, where optimization challenges require the usage of metric dimension [36].

•
Integer Programming, where the goal is to discover integer solutions that optimize a particular criterion [37].

•
Chemistry and Drug Discovery, where metric dimension is used in molecular networks and chemical compound analysis to characterize and describe chemical compounds in a distinctive way, assisting in the identification of novel medications or comprehending chemical interactions [38].
Overall, metric dimension is a parameter that may be used to solve optimization and representation issues in a variety of fields, allowing for effective resource allocation and decision-making while taking distance into account.It is intriguing to observe how this idea is used in disciplines as different as chemistry and computer science.

Stream Values of LFMD for Certain Families of Toeplitz Graphs
In this section, we find upper bounds sequences of LFMD for certain families of Toeplitz graphs.
where O + and E + are sets of positive odd integers and positive even integers, respectively.
Proof.If ℘ is an odd number, then the Toeplitz graph's vertex set T ℘ < 1, ℘ − 2 > is divided into two separate sets in the following manner: These two sets form a bipartite graph.So, according to Lemma 1, we have If ℘ is even, then the resolving sets are These resolving sets have the following cardinalities: Since the minimum and maximum cardinalities of the resolving sets are ℘ − 2 and ℘ − 1, respectively, thus, by relation (2) and Theorem 1, we have The proof is complete.
Then, the local fractional metric dimension is given by Proof.There are five cases to be studied.Case 1.When the Toeplitz graph then the resolving sets are The cardinalities of the above resolving set are Since the minimum cardinality is ℘ − 2, by relation (2), we have Case 2. When the Toeplitz graph The cardinalities of the above resolving set are Since the minimum and maximum cardinalities of the resolving sets are ℘ 2 and ℘ − 2, respectively, by relation ( 2) and Theorem 1, we have: Case 3. When the Toeplitz graph G = T ℘ < 1, 2, ℘ − 1 > has order ℘ ≡ 1 mod 4, then the following resolving sets are The cardinalities of the above resolving sets are The minimum and maximum cardinalities of the resolving sets are ℘+1 2 and ℘ − 1, respectively.Therefore, by relation (2) and Theorem 1, one has that Case 4. When the Toeplitz graph T ℘ < 1, 2, ℘ − 1 > has order ℘ ≡ 2 mod 4, then we have the following resolving sets: The cardinalities of the above resolving set are Since the minimum and maximum cardinalities of the resolving sets are ℘ 2 and ℘, respectively, it follows by relation ( 2) and Theorem 1 that Case 5. When the Toeplitz graph G = T ℘ < 1, 2, ℘ − 1 > has order ℘ ≡ 3 mod 4, then the resolving sets are The cardinalities of the above resolving set are Noting that the minimum and maximum cardinalities of the resolving sets are 3℘−5 4 and ℘ − 1, respectively, we conclude by relation (2) and Theorem 1 that The proof is complete.
Then, we have the following resolving sets: {j}.
Since the minimum and maximum cardinalities of the resolving sets are 8 and 2 k − 2, respectively, thus, by relation ( 2) and Theorem 1, we have which completes the proof.
Theorem 5. Let T 2p < 2, p > be a Toeplitz graph.The bounds of the local fractional metric Proof.Let T 2p < 2, p > be a Toeplitz graph.One has the following resolving sets: The cardinalates of the above resolving sets are In general, 2p − 2 is the minimal cardinality and 2p − 1 is the maximal cardinality for all prime numbers.So, by relation (2) and Theorem 1, we have The proof is complete.Theorem 6.Let T 3p < 3, p > be a Toeplitz graph where p is a prime number.The local fractional metric dimension of T 3p < 3, p > is equal to one, that is, Proof.The resolving sets for each adjacent pair of vertices are So, 3p is the minimal and maximal cardinality for all prime numbers and, by (2) and Theorem 1, which completes the proof.

LFMD for zero-divisor graphs Over the Set of Zero Divisors of Z n
In this section, we compute the LFMD for zero-divisor graphs over the set Z n .These graphs are defined as follows: the vertex set is the set of zero divisors of Z n and two vertices are adjacent to each other if their product is a zero divisor.They are denoted by G(Z n ).
where p is a prime number.
For illustration, let us take n = 22.Then, the zero-divisor graph is shown in Figure 4.For observation, we can take n = 33: the zero-divisor graph is shown in Figure 5.
The cardinality of the set ( 3) is 2 and since the total number of zero divisors of Z p k is p k−1 − 1, we conclude by Lemma 1 and Theorem 1 that The proof is complete.

LFMD of zero-divisor graphs Over Z n \ {0}
Now, we compute the LFMD for zero-divisor graphs over the set Z * n = Z n \ {0}.These graphs are defined as follows: the vertex set is Z n \ {0} = {1, 2, 3, . . ., n − 1} and two vertices are adjacent to each other if their product is a zero divisor.They are denoted by G(Z * n ).The zero-divisor graph Z 12 \ {0} is shown in Figure 6.The resolving sets corresponding to each pair of adjacent vertices are The cardinalates of the above resolving set are Since the minimum and maximum cardinalities of the resolving sets are 2 and 5, respectively, we know, by relation (2) and Theorem 1, that

Conclusions
The problem of determining the metric dimension of a given graph for a given integer is NP-hard.For big graphs, this means that the computation needed to find the metric dimension rises exponentially as the graph's size does, making it a difficult task.Metric dimension has proven invaluable in addressing problems across various disciplines, such as computer science, minimum distance calculations, and chemical graph theory.It has played a significant role in improving the representation of networks and graphs in real-world applications.Here, we investigated and discussed the asymptotic behavior of sequences for the local fractional metric dimension in families of Toeplitz and zero-divisor graphs.This sort of study is required in order to understand how the attributes of a particular graph or its properties behave as the graph's size increases.Without having to manually compute the parameters, asymptotic behavior enables researchers to make predictions about how the parameters will behave in bigger networks.It is also worth observing that constant, bounded, and unbounded metric families all include the obtained upper boundaries for the local fractional metric dimension.This implies that the metric dimension and associated ideas may be categorized and comprehended within certain families or categories of graphs, which can be useful for creating effective algorithms and resolving real-world issues in a variety of fields.We trust that our work has several potential applications.For instance, cryptography depends on coding and decoding, whereas the most attractive coding depends on linear programming problems.If the domain of the coding is the set of consecutive integers or some particular class of integers, then its programming is very suitable for cryptography.In our proposed work, the class of Toeplitz graphs is the zero-divisor graphs that depend on a set of consecutive integers and zero divisors of the commutative ring.We claim that our results can be used for coding and decoding in cryptography.
For future developments, we mention here some interesting open problems: • Toeplitz graph generalization is still up for debate.For such possible generalizations, it would be great to determine some upper bounds of the local fractional metric dimension for T n S for each subset S of {1, 2, . . ., n}.

•
For any positive integer n, upper bounds for the LFMD of zero-divisor graphs G(Z n ) are yet unknown.

•
For any positive integer n, to obtain upper bounds for the LFMD of zero-divisor graphs over the set G(Z * n ) is still open.

Theorem 7 .
Let G(Z n ) be a zero-divisor graph.An upper bound of the local fractional metric

Table 3 .
Numerical comparison between lower bound values of

Table 4 .
Numerical comparison between upper bounds values of T