Fault-tolerant metric dimension problem: a new integer linear programming formulation and exact formula for grid graphs
From MaRDI portal
(Redirected from Publication:5011071)
Recommendations
- Minimum fault-tolerant, local and strong metric dimension of graphs.
- Fault-tolerant metric dimension of generalized wheels and convex polytopes
- On the fault-tolerant metric dimension of certain interconnection networks
- Fault-tolerant metric dimension of graphs
- Fault-tolerant strong metric dimension of graphs
Cites work
- Fault-tolerance in resolvability
- Fault-tolerant metric dimension of graphs
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- Landmarks in graphs
- Minimum Fault-Tolerant, local and strong metric dimension of graphs
- Minimum fault-tolerant, local and strong metric dimension of graphs.
Cited in
(5)- Fault-tolerant resolvability in some classes of line graphs
- Resolving sets tolerant to failures in three-dimensional grids
- Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks
- Minimum fault-tolerant, local and strong metric dimension of graphs.
- Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
This page was built for publication: Fault-tolerant metric dimension problem: a new integer linear programming formulation and exact formula for grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5011071)
