Independent locating-dominating sets and identifying codes in graphs

MaRDI QIDQ4566243zbMATH OpenFDO

Authors J. Louis Sewell, Peter Slater

Publication date 14 June 2018

Mathematics Subject Classification ID

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

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

Cited in

(9)

• Identifying and locating-dominating codes on chains and cycles
• Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
• Fault-tolerant detectors for distinguishing sets in cubic graphs
• On redundant locating-dominating sets
• Locating mobile intruders using dominating sets
• Open-independent, open-locating-dominating sets
• Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
• Independent location-domination number of graphs
• Fault tolerant detectors for distinguishing sets in 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)