Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
From MaRDI portal
Publication:440965
DOI10.1016/j.amc.2012.03.047zbMath1245.90085OpenAlexW2078833136MaRDI QIDQ440965
Jozef Kratica, Milica Stojanović, Mirjana Čangalović, Vera V. Kovacevic-Vujcic
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
Related Items
Computing the metric dimension of wheel related graphs ⋮ Edge version of metric dimension and doubly resolving sets of the necklace graph ⋮ The equidistant dimension of graphs ⋮ Closed formulae for the strong metric dimension of lexicographic product graphs ⋮ The convex and weak convex domination number of convex polytopes ⋮ Fault-tolerant strong metric dimension of graphs ⋮ On the strong partition dimension of graphs ⋮ On the metric determination of linear dependence graph ⋮ Approximation for the minimum cost doubly resolving set problem ⋮ Strong resolving graphs: the realization and the characterization problems ⋮ The strong metric dimension of some generalized Petersen graphs ⋮ Metric Properties of Non-Commuting Graph Associated to Two Groups ⋮ The binary locating-dominating number of some convex polytopes ⋮ The difference between several metric dimension graph invariants ⋮ The strong metric dimension of the power graph of a finite group ⋮ Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph ⋮ On the geodesic identification of vertices in convex plane graphs ⋮ On the fault-tolerant metric dimension of convex polytopes ⋮ The simultaneous strong metric dimension of graph families ⋮ On the strong metric dimension of tetrahedral diamond lattice ⋮ Computation of the double metric dimension in convex polytopes ⋮ A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem ⋮ On the fault-tolerant metric dimension of certain interconnection networks ⋮ Variable neighborhood search for the strong metric dimension problem ⋮ Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ Resolvability and fault-tolerant resolvability structures of convex polytopes ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes ⋮ Computing edge version of metric and double metric dimensions of Kayak paddle graphs ⋮ The doubly metric dimension of cylinder graphs and torus graphs ⋮ On the metric dimension of two families of convex polytopes
Cites Work
- On families of convex polytopes with constant metric dimension
- The metric dimension of Cayley digraphs
- Computing the metric dimension of graphs by genetic algorithms
- The strong metric dimension of graphs and digraphs
- Computing minimal doubly resolving sets of graphs
- On \(k\)-dimensional graphs and their bases
- Resolvability in graphs and the metric dimension of a graph
- Landmarks in graphs
- On the metric dimension of some families of graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- On Metric Generators of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
