For facilities safeguards problems in which one is interested in detecting the presence of, and determining the exact location of, an intruder, and for determining an inoperable component in a processor network, locating-dominating sets are of interest. Vertex set S in graph G= (V,E) is a locating-dominating set if for each pair of distinct vertices u and υ in V(G) - S we have φ ≠ N(u)∩S≠N(υ)∩S, that is, each vertex outside of S is adjacent to a distinct, nonempty subset of the elements of S. This paper introduces the study of single-fault-tolerant locating-dominating sets. The percent of vertices in the 2-dimensional infinite grid required for a fault-tolerant locating-dominating set is between 52% and 60%, while that for just a locating-dominating set is 30%.
[1]
B. L. Hulme,et al.
Network analysis of fire protection
,
1981
.
[2]
B. L. Hulme,et al.
Computing minimum cost fire protection. [PROTECT computer code]
,
1982
.
[3]
P. Slater,et al.
A Boolean algebraic analysis of fire protection
,
1984
.
[4]
Mark G. Karpovsky,et al.
On a New Class of Codes for Identifying Vertices in Graphs
,
1998,
IEEE Trans. Inf. Theory.
[5]
Gérard D. Cohen,et al.
New Bounds for Codes Identifying Vertices in Graphs
,
1999,
Electron. J. Comb..
[6]
Simon Litsyn,et al.
Bounds on identifying codes
,
2001,
Discret. Math..
[7]
Peter J. Slater.
Domination and location in acyclic graphs
,
1987,
Networks.