Independent locating-dominating sets and identifying codes in graphs
From MaRDI portal
Publication:4566243
Recommendations
Cited in
(8)- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- Fault tolerant detectors for distinguishing sets in graphs
- Locating mobile intruders using dominating sets
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Open-independent, open-locating-dominating sets
- Identifying and locating-dominating codes on chains and cycles
- On redundant locating-dominating sets
- Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
This page was built for publication: Independent locating-dominating sets and identifying codes in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566243)