Loading...
Loading...

Go to the content (press return)

On global location-domination in graphs

Author
Hernando, M.; Mora, M.; Pelayo, I. M.
Type of activity
Journal article
Journal
ARS Mathematica Contemporanea
Date of publication
2015-05-29
Volume
8
Number
2
First page
365
Last page
379
Repository
http://hdl.handle.net/2117/28254 Open in new window
URL
http://amc-journal.eu/index.php/amc/article/view/591/799 Open in new window
Abstract
A dominating set S of a graph G is called locating-dominating, 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 lambda(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 lambda g(G) is introduced as the minimum cardinali...
Citation
Hernando, M.; Mora, M.; Pelayo, I. M. On global location-domination in graphs. "ARS Mathematica Contemporanea", 29 Maig 2015, vol. 8, núm. 2, p. 365-379.
Keywords
Domination, block-cactus., complement graph, global domination, locating domination
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Attachments