Minimal doubly resolving sets of prism graphs

DOI10.1080/02331934.2013.772999zbMath1278.05087OpenAlexW1968625765MaRDI QIDQ2868916

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

Publication date: 19 December 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.772999

zbMATH Keywords

generalized Petersen graphsmetric dimensionminimal doubly resolving setprism graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (11)

Edge version of metric dimension and doubly resolving sets of the necklace graph ⋮ The equidistant dimension of graphs ⋮ Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph ⋮ Graphs with doubly resolving number 2 ⋮ Approximation for the minimum cost doubly resolving set problem ⋮ Computation of the double metric dimension in convex polytopes ⋮ Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs ⋮ On doubly resolving sets in graphs ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ Computing edge version of metric and double metric dimensions of Kayak paddle graphs ⋮ The doubly metric dimension of cylinder graphs and torus graphs

Cites Work

• Computing the metric dimension of graphs by genetic algorithms
• Computing minimal doubly resolving sets of graphs
• Landmarks in graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Self-dual configurations and regular graphs

This page was built for publication: Minimal doubly resolving sets of prism graphs