Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Nordhaus-Gaddum bounds for locating domination

Autor
Hernando, M.; Mora, M.; Pelayo, I. M.
Tipus d'activitat
Article en revista
Revista
European journal of combinatorics
Data de publicació
2014-02-01
Volum
36
Pàgina inicial
1
Pàgina final
6
DOI
https://doi.org/10.1016/j.ejc.2013.04.009 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/21023 Obrir en finestra nova
Resum
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 ...
Citació
Hernando, M.; Mora, M.; Pelayo, I. Nordhaus-Gaddum bounds for locating domination. "European journal of combinatorics", 01 Febrer 2014, vol. 36, p. 1-6.
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry