Global location-domination in graphs
Tipus de documentReport de recerca
Condicions d'accésAccés obert
A dominating set S of a graph G is called locating-dominating, LD-setfor 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 (G). An LD-set S of a graph G is global if it is an LD-set of both G and its complement G. The global location-domination number g(G) is the minimum cardinality of a global LD-set of G. In this work,we give some relations between locating-dominating sets and the location-domination number in a graph and its complement
Domination, Global domination, Locating domination, Complement graph, Block-cactus, Trees
CitacióHernando, M.; Mora, M.; Pelayo, I. M. "Global location-domination in graphs". 2013.
Versió de l'editorhttp://arxiv.org/pdf/1312.0772.pdf