Loading...
Loading...

Go to the content (press return)

LD-graphs and global location-domination in bipartite graphs

Author
Hernando, M.; Mora, M.; Pelayo, I. M.
Type of activity
Presentation of work at congresses
Name of edition
IX Jornadas de Matematica Discreta y Algorítmica
Date of publication
2014
Presentation's date
2014-07-08
Book of congress proceedings
IX Jornadas de Matematica Discreta y Algoritimica, 7 al 9 de julio de 2014, Tarragona
First page
367
Last page
374
Repository
http://hdl.handle.net/2117/24830 Open in new window
URL
http://deim.urv.cat/~discrete-math/JMDA2014/Actas.pdf Open in new window
Abstract
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 ). 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 edg...
Citation
Hernando, 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.
Keywords
bipartite graph, complement graph, domination, location
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants

Attachments