Carregant...
Carregant...

Vés al contingut (premeu Retorn)

LD-graphs and global location-domination in bipartite graphs

Autor
Hernando, M.; Mora, M.; Pelayo, I. M.
Tipus d'activitat
Article en revista
Revista
Electronic notes in discrete mathematics
Data de publicació
2014-09-02
Volum
46
Pàgina inicial
225
Pàgina final
232
DOI
https://doi.org/10.1016/j.endm.2014.08.030 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/24527 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S1571065314000316# Obrir en finestra nova
Resum
A dominating set S of a graph G is a locating-dominating-set, 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, ¿(G)¿(G). An LD-set S of a graph G is global if it is an LD-set for both G and its complement, View the MathML sourceG¯. One of the main contributions of this work is ...
Citació
Hernando, M.; Mora, M.; Pelayo, I. M. LD-graphs and global location-domination in bipartite graphs. "Electronic notes in discrete mathematics", 02 Setembre 2014, vol. 46, p. 225-232.
Paraules clau
Domination, Location, Complement Graph, Bipartite Graph
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry