Let G=(V, E) be a simple connected graph. An ordered subset W of V is said to be a
resolving set of G if every vertex is uniquely determined by its vector of distances to the …

Abstract Let S⊆ V (G). Then S is said to resolve the whole graph G if every vertex in V (G) is
uniquely determined by its distance-vector to all vertices in the set S. The minimum …

In this paper, we investigate the total resolving number of edge cycle graphs G (C3) G (C_3)
G (C3​). When their edge cycle graphs are considered, we determine the exact values for …

Abstract Let G=(V, E) be a simple connected graph. An ordered subset W of V is said to be a
resolving set of G if every vertex is uniquely determined by its vector of distances to the …

A vertex v∈ V (G) that lies at the same distance from at least two distinct vertices u and w is
said to be a distance similar vertex with respect to u and w. A set S⊂ V (G) of vertices is said …

Let G=(V, E) be a simple connected graph. An ordered subset W of V is said to be a
resolving set of G if every vertex is uniquely determined by its vector of distances to the …