Loading...
Loading...

Go to the content (press return)

Nordhaus-Gaddum bounds for locating domination

Author
Hernando, M.; Mora, M.; Pelayo, I. M.
Type of activity
Journal article
Journal
European journal of combinatorics
Date of publication
2014-02-01
Volume
36
First page
1
Last page
6
DOI
https://doi.org/10.1016/j.ejc.2013.04.009 Open in new window
Repository
http://hdl.handle.net/2117/21023 Open in new window
Abstract
A dominating set S of graph G is called metric-locating–dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S. If moreover, every vertex v not in S is also uniquely determined by the set of neighbors of v belonging to S, then it is said to be locating–dominating. Locating, metric-locating–dominating and locating–dominating sets of minimum cardinality are called ß-codes, ¿-codes and ¿-codes, respectively. A ...
Citation
Hernando, M.; Mora, M.; Pelayo, I. Nordhaus-Gaddum bounds for locating domination. "European journal of combinatorics", 01 Febrer 2014, vol. 36, p. 1-6.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry