Fault-tolerant locating-dominating sets with error-correction
From MaRDI portal
Cites work
- An optimal locating-dominating set in the infinite triangular grid
- Density of identifying codes of hexagonal grids with finite number of rows
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Domination and location in acyclic graphs
- Error-correcting open-locating-dominating sets
- Fault tolerant detectors for distinguishing sets in graphs
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Fault-tolerant identifying codes in special classes of graphs
- Fault-tolerant locating-dominating sets
- Generalized set dominating and separating systems
- Generation of cubic graphs
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- scientific article; zbMATH DE number 4053685 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 3503313 (Why is no real title available?)
- Locating-dominating sets in twin-free graphs
- Locating-total domination in claw-free cubic graphs
- Location-domination and matching in cubic graphs
- On a conjecture on total domination in claw-free cubic graphs
- On a new class of codes for identifying vertices in graphs
- On identifying codes
- On locating--dominating sets in infinite grids
- On redundant locating-dominating sets
- Open neighborhood locating-dominating in trees
- Optimal error-detecting open-locating-dominating set on the infinite triangular grid
- Optimal error-detection system for identifying codes
- Progress on fault-tolerant locating-dominating sets
- Watching systems in graphs: an extension of identifying codes
This page was built for publication: Fault-tolerant locating-dominating sets with error-correction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6837211)
