A dominating set
S
of a graph
G
is a
locatingdominatingset
,
LDset
for
short, if every vertex
v
not in
S
is uniquely determined by the set of neighbors of
v
belonging to
S
. Locatingdominating sets of minimum cardinality are called
LD

codes
and the cardinality of an LDcode is the
locationdomination number
,
¿
(
G
).
An LDset
S
of a graph
G
is
global
if it is an LDset for both
G
and its complement,
G
. One of the main contributions of this work is the definition of the
LDgraph
,an
edg...
A dominating set
S
of a graph
G
is a
locatingdominatingset
,
LDset
for
short, if every vertex
v
not in
S
is uniquely determined by the set of neighbors of
v
belonging to
S
. Locatingdominating sets of minimum cardinality are called
LD

codes
and the cardinality of an LDcode is the
locationdomination number
,
¿
(
G
).
An LDset
S
of a graph
G
is
global
if it is an LDset for both
G
and its complement,
G
. One of the main contributions of this work is the definition of the
LDgraph
,an
edgelabeled graph associated to an LDset, that will be very helpful to deduce some
properties of locationdomination in graphs. Concretely, we use LDgraphs to study
the relation between the locationdomination number in a bipartite graph and its
complement
A dominating setS of a graph G is a locatingdominatingset, LDset for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locatingdominating sets of minimum cardinality are called LD  codes
and the cardinality of an LDcode is the
locationdomination number
,
¿
(
G
).
An LDset
S
of a graph
G
is
global
if it is an LDset for both
G
and its complement,
G
. One of the main contributions of this work is the definition of the
LDgraph
,an
edgelabeled graph associated to an LDset, that will be very helpful to deduce some
properties of locationdomination in graphs. Concretely, we use LDgraphs to study
the relation between the locationdomination number in a bipartite graph and its
complement
Citation
Hernando, M.; Mora, M.; Pelayo, I. M. LDgraphs and global locationdomination in bipartite graphs. A: Jornadas de Matematica Discreta y Algorítmica. "IX Jornadas de Matematica Discreta y Algoritimica, 7 al 9 de julio de 2014, Tarragona". Tarragona: 2014, p. 367374.