Due to the immense applications of interconnection networks, various new networks are
designed and extensively used in computer sciences and engineering fields. Networks can …

The position of a moving point in a connected graph can be identified by computing the
distance from the point to a set of sonar stations which have been appropriately situated in …

Polyphenyl is used in a variety of applications including high‐vacuum devices, optics, and
electronics, and in high‐temperature and radiation‐resistant fluids and greases, it has low …

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 …

For an ordered subset Qe of vertices in a simple connected graph G, a vertex x∈ V
distinguishes two edges e1, e2∈ E, if d (x, e1)≠ d (x, e2). A subset Qe having minimum …

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 …

In this paper, we study the metric dimension of barycentric subdivision of Möbius ladders
and the metric dimension of generalized Petersen multigraphs. We prove that the …

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 …

An ordered set W={w 1,…, wk}⊆ V (G) of vertices of G is called a resolving set or locating set
for G if every vertex is uniquely determined by its vector of distances to the vertices in W. A …

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 …