The metric dimension of a graph is the smallest number of nodes required to identify all
other nodes uniquely based on shortest path distances. Applications of metric dimension …

Jurnal Limits: Journal of Mathematics and Its Applications terbit dua kali dalam setahun,
pada bulan Mei dan November. Jurnal Limits terbit pertama kali (vol. 1 no. 1) pada tahun …

A set of vertices W is a resolving set of a graph G if every two vertices of G have distinct
representations of distances with respect to the set W. The number of vertices in a smallest …

A set of vertices W resolves a graph G if every vertex is uniquely determined by its
coordinate of distance to the vertices in W. The minimum cardinality of a resolving set of G is …

Concepts of resolving set and metric basis has enjoyed a lot of success because of multi-
purpose applications both in computer and mathematical sciences. For a connected graph G …

Resolving set and metric basis has become an integral part in combinatorial chemistry and
molecular topology. It has a lot of applications in computer, chemistry, pharmacy and …

Locating the sources of information spreading in networks including tracking down the
origins of epidemics, rumors in social networks, and online computer viruses, has a wide …

Let G be a connected graph with vertex set V (G) and edge set E (G). The distance between
vertices u and v in G is denoted by d (u, v), which serves as the shortest path length from u to …

For any given graph G, we say W⊆ V (G) is a resolving set or resolves the graph G if every
vertex of G is uniquely determined by its vector of distances to the vertices in W. The metric …

Consider a simple connected undirected graph G=(V< sub> G, E< sub> G), where V< sub>
G represents the vertex set and E< sub> G represents the edge set respectively. A subset B …