论文部分内容阅读
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 different.The locating-domination number γ L (G) is the minimum cardinality of an LDS of G