Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Global location-domination in graphs

Autor
Hernando, M.; Mora, M.; Pelayo, I. M.
Tipus d'activitat
Document cientificotècnic
Data
2013-12-03
Repositori
http://hdl.handle.net/2117/27680 Obrir en finestra nova
URL
http://arxiv.org/pdf/1312.0772.pdf Obrir en finestra nova
Resum
A dominating set S of a graph G is called locating-dominating, LD-setfor 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 of both G and its complement G. The global location-domination number g(G) is the minimum cardinality of a global LD-set of G...
Citació
Hernando, M.; Mora, M.; Pelayo, I. M. "Global location-domination in graphs". 2013.
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta

Arxius