MINIMAL DOUBLY RESOLVING SETS OF ANTIPRISM GRAPHS AND MOBIUS LADDERS

Article

Abstract: Consider a simple connected graph G = (V(G),E(G)), where V(G) represents the vertex set and E(G) rep

Palabras claves:

Antiprism graph, Metric dimension, Minimal doubly resolving set, Mobius ladder., Resolving set

Autores:

Ahmad A., Imran M., Martin Bača, Sultan S.

Fuentes:

scopus