Locating domination in graphs and their complementss

  • C. Hernandoa, M. Morab, I. M. Pelayoc
  • Published 2013


Resumen. A dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality are called LD-codes and the cardinality of an LD-code is the location-domination number. An LD-set of a graph G is global if S… (More)


4 Figures and Tables

Slides referencing similar topics