Resolving sets tolerant to failures in three-dimensional grids
From MaRDI portal
Publication:2167827
DOI10.1007/s00009-022-02096-1zbMath1493.05088arXiv2112.08768OpenAlexW4285008974MaRDI QIDQ2167827
Ana D. Tarrío-Tobar, Mercè Mora, María José Souto Salorio
Publication date: 31 August 2022
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.08768
resolving setmetric dimension\(k\)-metric dimensionfault-tolerantthree-dimensional grid\(k\)-resolving set
Cites Work
- The \(k\)-metric dimension of the lexicographic product of graphs
- \(k\)-metric resolvability in graphs
- The \(k\)-metric dimension of corona product graphs
- Mastermind
- Fault tolerant detectors for distinguishing sets in graphs
- Resolvability in graphs and the metric dimension of a graph
- Error-correcting codes from \(k\)-resolving sets
- Computing the \(k\)-metric dimension of graphs
- Some binary products and integer linear programming for \(k\)-metric dimension of graphs
- On the fault-tolerant metric dimension of certain interconnection networks
- On the metric dimension of Cartesian powers of a graph
- Landmarks in graphs
- Minimum Fault-Tolerant, local and strong metric dimension of graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Resolving sets tolerant to failures in three-dimensional grids