Minimal doubly resolving sets of necklace graph

Article

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

Palabras claves:

Metric dimension, Minimal doubly resolving set, Necklace graph, Resolving set

Autores:

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

Fuentes:

scopus