Independent locating-dominating sets and identifying codes in graphs

zbMATH Open1390.05178MaRDI QIDQ4566243FDOQ4566243

Authors: J. Louis Sewell, Peter Slater 

Publication date: 14 June 2018

Recommendations

• Open-independent, open-locating-dominating sets
• Fault-tolerant locating-dominating sets
• Fault tolerant detectors for distinguishing sets in graphs
• Locating mobile intruders using dominating sets
• Locating-dominating codes: bounds and extremal cardinalities

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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
• Open-independent, open-locating-dominating sets
• Fault-tolerant detectors for distinguishing sets in cubic graphs
• 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)