Loading...
Loading...

Go to the content (press return)

Locating domination in graphs and their complements

Author
Hernando, M.; Mora, M.; Pelayo, I. M.
Type of activity
Book chapter
Book
Avances en Matemàtica Discreta en Andalucía (Vol. III)
First page
183
Last page
190
Publisher
Universidad de Sevilla
Date of publication
2013-10-16
ISBN
978-84-15881-46-9 Open in new window
Repository
http://hdl.handle.net/2117/21284 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 . An LD-set of a graph G is global if S is an LD-set of both G and its complement, G . In this work, we give some relations between the locating-dominating sets and location-domination ...
Citation
Hernando, M.; Mora, M.; Pelayo, I. Locating domination in graphs and their complements. A: "Avances en Matem atica Discreta en Andaluc a (Vol. III)". Sevilla: Universidad de Sevilla, 2013, p. 183-190.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Attachments