Extremal cubic graphs for fault-tolerant locating domination
From MaRDI portal
Publication:2143147
Recommendations
Cites work
- scientific article; zbMATH DE number 5717189 (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?)
- Distance-hereditary graphs
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Fault tolerant detectors for distinguishing sets in graphs
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Fault-tolerant locating-dominating sets
- Generation of cubic graphs
- 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 locating--dominating sets in infinite grids
- On robust and dynamic identifying codes
- Open neighborhood locating-dominating in trees
- Tolerant location detection in sensor networks
- Watching systems in graphs: an extension of identifying codes
Cited in
(2)
This page was built for publication: Extremal cubic graphs for fault-tolerant locating domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2143147)