LD-graphs and global location-domination in bipartite graphs
Rights accessRestricted access - publisher's policy
A dominating set S of a graph G is a locating-dominating-set, 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, ¿(G)¿(G). An LD-set S of a graph G is global if it is an LD-set for both G and its complement, View the MathML sourceG¯. One of the main contributions of this work is the definition of the LD-graph, an edge-labeled graph associated to an LD-set, that will be very helpful to deduce some properties of location-domination in graphs. Concretely, we use LD-graphs to study the relation between the location-domination number in a bipartite graph and its complement.
CitationHernando, M.; Mora, M.; Pelayo, I. M. LD-graphs and global location-domination in bipartite graphs. "Electronic notes in discrete mathematics", 02 Setembre 2014, vol. 46, p. 225-232.