Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
From MaRDI portal
Publication:440965
DOI10.1016/J.AMC.2012.03.047zbMATH Open1245.90085OpenAlexW2078833136MaRDI QIDQ440965FDOQ440965
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
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
- Resolvability in graphs and the metric dimension of a graph
- Classes of convex polytopes with constant metric dimension
- On the metric dimension of some families of graphs
- On the Metric Dimension of Cartesian Products of Graphs
- On the metric dimension of the Jahangir graph
- On families of convex polytopes with constant metric dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- On \(k\)-dimensional graphs and their bases
- Landmarks in graphs
- Families of regular graphs with constant metric dimension
- Title not available (Why is that?)
- On Metric Generators of Graphs
- The strong metric dimension of graphs and digraphs
- The metric dimension and metric independence of a graph
- The metric dimension of Cayley digraphs
- The strong dimension of distance-hereditary graphs
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- Computing minimal doubly resolving sets of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the metric dimension of graphs by genetic algorithms
Cited In (39)
- Minimal doubly resolving sets of prism graphs
- On the strong partition dimension of graphs
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- The doubly metric dimension of cylinder graphs and torus graphs
- On the metric dimension of two families of convex polytopes
- On the geodesic identification of vertices in convex plane graphs
- The equidistant dimension of graphs
- Variable neighborhood search for the strong metric dimension problem
- The doubly metric dimensions of cactus graphs and block graphs
- On minimal edge version of doubly resolving sets of a graph
- On the fault-tolerant metric dimension of convex polytopes
- Computing the metric dimension of wheel related graphs
- On the fault-tolerant metric dimension of certain interconnection networks
- Strong resolving graphs: the realization and the characterization problems
- The simultaneous strong metric dimension of graph families
- Edge version of metric dimension and doubly resolving sets of the necklace graph
- Minimum fault-tolerant, local and strong metric dimension of graphs.
- The convex and weak convex domination number of convex polytopes
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices
- Computing minimal doubly resolving sets of graphs
- The strong metric dimension of some generalized Petersen graphs
- Approximation for the minimum cost doubly resolving set problem
- Closed formulae for the strong metric dimension of lexicographic product graphs
- Computing edge version of metric and double metric dimensions of kayak paddle graphs
- Resolvability and fault-tolerant resolvability structures of convex polytopes
- Computation of the double metric dimension in convex polytopes
- Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
- Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs
- On the metric determination of linear dependence graph
- Fault-tolerant metric dimension of barycentric subdivision of Cayley graphs
- On the strong metric dimension of tetrahedral diamond lattice
- Fault-tolerant strong metric dimension of graphs
- The difference between several metric dimension graph invariants
- Metric Properties of Non-Commuting Graph Associated to Two Groups
- The binary locating-dominating number of some convex polytopes
- The strong metric dimension of the power graph of a finite group
- Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party 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)
