# MINIMAL DOUBLY RESOLVING SETS OF ANTIPRISM GRAPHS AND MOBIUS LADDERS

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

## Resumen

Consider a simple connected graph G = (V(G),E(G)), where V(G) represents the vertex set and E(G) represents the edge set respectively. A subset W of V(G) is called a resolving set for a graph G if for every two distinct vertices x, y ∈V(G), there exist some vertex w ∈W such that d(x,w) 6≠ d(y,w), where d(u, v) denotes the distance between vertices u and v. A resolving set of minimal cardinality is called a metric basis for G and its cardinality is called the metric dimension of G, which is denoted by β(G). A subset D of V(G) is called a doubly resolving set of G if for every two distinct vertices x, y of G, there are two vertices u, v ∈ D such that d(u, x) − d(u, y) 6= d(v, x) − d(v, y). A doubly resolving set with minimum cardinality is called minimal doubly resolving set. This minimum cardinality is denoted by ψ(G). In this paper, we determine the minimal doubly resolving sets for antiprism graphs denoted by An with n ≥ 3 and for Möbius ladders denoted by Mn, for every even positive integer n ≥ 8.

Idioma original Inglés 457-469 13 Miskolc Mathematical Notes 23 1 https://doi.org/10.18514/MMN.2022.1950 Publicada - 2022 Sí

## Huella

Profundice en los temas de investigación de 'MINIMAL DOUBLY RESOLVING SETS OF ANTIPRISM GRAPHS AND MOBIUS LADDERS'. En conjunto forman una huella única.