Mostrando 2 resultados de: 2
MINIMAL DOUBLY RESOLVING SETS OF ANTIPRISM GRAPHS AND MOBIUS LADDERS
ArticleAbstract: Consider a simple connected graph G = (V(G),E(G)), where V(G) represents the vertex set and E(G) repPalabras claves:Antiprism graph, Metric dimension, Minimal doubly resolving set, Mobius ladder., Resolving setAutores:Ahmad A., Imran M., Martin Bača, Sultan S.Fuentes:scopusMinimal doubly resolving sets of necklace graph
ArticleAbstract: Consider a simple connected undirected graph G = (V;E), where V represents the vertex set and E reprPalabras claves:Metric dimension, Minimal doubly resolving set, Necklace graph, Resolving setAutores:Ahmad A., Martin Bača, Sultan S.Fuentes:scopus