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 …

In this paper, we consider the NP-hard problem of finding the minimum connected resolving
set of graphs. A vertex set B of a connected graph G resolves G if every vertex of G is …

For a graph G, an ordered set S⊆ V (G) is called the resolving set of G, if the vector of
distances to the vertices in S is distinct for every v∈ V (G). The minimum cardinality of S is …

For a connected graph, the distance between any two vertices, is defined as; ie the minimum
length of path connecting any two vertices. Two vertices, of a graph are said to be resolved …

The localisation of a network is the process of gaining access to a node's precise location or
position. Using this technology, it is possible to determine the exact position of each network …

In this paper, we consider the NP-hard problem of finding the minimum resolving set of
graphs. A vertex set B of a connected graph G resolves G if every vertex of G is uniquely …

Power utilities must track their power networks to respond to changing demand and
availability conditions to ensure effective and efficient operation. As a result, several power …

Resolving partition and partition dimension have multipurpose applications in computer,
networking, optimization, mastermind games and modelling of chemical substances. The …

The concept of minimal resolving partition and resolving set plays a pivotal role in diverse
areas such as robot navigation, networking, optimization, mastermind games and coin …