Open Locating-Dominating Sets in Circulant Graphs

Abstract

Location detection problems have been studied for a variety of applications including finding faults in multiprocessors, contaminants in public utilities, intruders in buildings and facilities, and for environmental monitoring using wireless sensor networks. In each of these applications, the system or structure can be modeled as a graph, and sensors placed strategically at a subset of vertices can locate and detect anomalies in the system.

Keywords

• open locating-dominating sets
• circulant graphs
• hall’s matching theorem
• mixed-weight open locating-dominating sets
• 05c69