Minimal doubly resolving sets and the strong metric dimension of some convex polytopes

DOI10.1016/J.AMC.2012.03.047MaRDI QIDQ440965zbMATH OpenOpenAlexFDO

Authors Jozef Kratica, Mirjana Čangalović, Milica Stojanović, Vera Kovačević-Vujčić

Publication date 19 August 2012

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2012.03.047

zbMATH Keywords

convex polytopesstrong metric dimensionminimal doubly resolving set

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph
• Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph
• On families of convex polytopes with constant metric dimension
• On the metric dimension of two classes of convex polytopes

Cites work

• scientific article; zbMATH DE number 4081585 (Why is no real title available?)
• scientific article; zbMATH DE number 125446 (Why is no real title available?)
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 6119641 (Why is no real title available?)
• Classes of convex polytopes with constant metric dimension
• Computing minimal doubly resolving sets of graphs
• Computing strong metric dimension of some special classes of graphs by genetic algorithms
• Computing the metric dimension of graphs by genetic algorithms
• Families of regular graphs with constant metric dimension
• Landmarks in graphs
• On Metric Generators of Graphs
• On \(k\)-dimensional graphs and their bases
• On families of convex polytopes with constant metric dimension
• On the Metric Dimension of Cartesian Products of Graphs
• On the metric dimension of some families of graphs
• On the metric dimension of the Jahangir graph
• Resolvability in graphs and the metric dimension of a graph
• The metric dimension and metric independence of a graph
• The metric dimension of Cayley digraphs
• The strong dimension of distance-hereditary graphs
• The strong metric dimension of graphs and digraphs

Cited in

(39)

• Edge version of metric dimension and doubly resolving sets of the necklace graph
• Metric-locating-dominating sets of graphs for constructing related subsets of vertices
• Minimum fault-tolerant, local and strong metric dimension of graphs.
• On minimal edge version of doubly resolving sets of a graph
• The equidistant dimension of graphs
• Fault-tolerant metric dimension of barycentric subdivision of Cayley graphs
• On the fault-tolerant metric dimension of convex polytopes
• Computing the metric dimension of wheel related graphs
• On the strong metric dimension of tetrahedral diamond lattice
• The strong metric dimension of some generalized Petersen graphs
• The binary locating-dominating number of some convex polytopes
• Computation of the double metric dimension in convex polytopes
• The difference between several metric dimension graph invariants
• Computing minimal doubly resolving sets of graphs
• Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph
• Minimal doubly resolving sets of prism graphs
• Variable neighborhood search for the strong metric dimension problem
• Computing edge version of metric and double metric dimensions of kayak paddle graphs
• The convex and weak convex domination number of convex polytopes
• The doubly metric dimensions of cactus graphs and block graphs
• On the strong partition dimension of graphs
• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• Approximation for the minimum cost doubly resolving set problem
• Fault-tolerant strong metric dimension of graphs
• Metric Properties of Non-Commuting Graph Associated to Two Groups
• Resolvability and fault-tolerant resolvability structures of convex polytopes
• The simultaneous strong metric dimension of graph families
• Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph
• The doubly metric dimension of cylinder graphs and torus graphs
• Strong resolving graphs: the realization and the characterization problems
• A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
• On the metric dimension of two families of convex polytopes
• Binary locating-dominating sets in rotationally-symmetric convex polytopes
• Closed formulae for the strong metric dimension of lexicographic product graphs
• On the geodesic identification of vertices in convex plane graphs
• Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
• On the fault-tolerant metric dimension of certain interconnection networks
• The strong metric dimension of the power graph of a finite group
• On the metric determination of linear dependence graph

This page was built for publication: Minimal doubly resolving sets and the strong metric dimension of some convex polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q440965)