Minimal doubly resolving sets and the strong metric dimension of Hamming graphs

From MaRDI portal
Publication:5396538

DOI10.2298/AADM111116023KzbMath1289.05400MaRDI QIDQ5396538

Milica Stojanović, Mirjana Čangalović, Jozef Kratica, Vera V. Kovacevic-Vujcic

Publication date: 7 February 2014

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)




Related Items (20)

Edge version of metric dimension and doubly resolving sets of the necklace graphGeodesic transversal problem for join and lexicographic product of graphsOn the strong metric dimension of Cartesian and direct products of graphsMetric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graphGraphs with doubly resolving number 2On the strong partition dimension of graphsApproximation for the minimum cost doubly resolving set problemStrong resolving graphs: the realization and the characterization problemsComputing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graphOn the geodesic identification of vertices in convex plane graphsOn the strong metric dimension of the strong products of graphsThe simultaneous strong metric dimension of graph familiesComputation of the double metric dimension in convex polytopesA bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problemVariable neighborhood search for the strong metric dimension problemAlgorithmic aspect on the minimum (weighted) doubly resolving set problem of graphsOn doubly resolving sets in graphsMetric-locating-dominating sets of graphs for constructing related subsets of verticesComputing edge version of metric and double metric dimensions of Kayak paddle graphsThe doubly metric dimension of cylinder graphs and torus graphs




This page was built for publication: Minimal doubly resolving sets and the strong metric dimension of Hamming graphs