On locating-domination in graphs
Mustapha Chellali, Malika Mimouni, Peter J. Slater · Discussiones Mathematicae Graph Theory · 2010
A set D of vertices in a graph G = (V; E) is a locating-dominating set (LDS) if for every two vertices u; v of V D the sets N(u) D and N(v) D are non-empty and dieren t. The locating-domination number L(G) is the minimum cardinality of a LDS of G; and the upper locating-domination number, L(G) is the maximum cardinality of a minimal LDS of G. We present dieren t bounds on L(G) and L(G):