LD-graphs and global location-domination in bipartite graphs
Cita com:
hdl:2117/24830
Document typeConference report
Defense date2014
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
A dominating setS 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
).
An LD-set
S
of a graph
G
is
global
if it is an LD-set for both
G
and its complement,
G
. 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. 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. 367-374.
Publisher versionhttp://deim.urv.cat/~discrete-math/JMDA2014/Actas.pdf
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
Actas LD global in bipartites graphs.pdf | LD-graphs and global location-domination in bipartite graphs | 103,9Kb | View/Open |