Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Locating domination in bipartite graphs and their complements

Autor
Hernando, M.; Mora, M.; Pelayo, I. M.
Tipus d'activitat
Document cientificotècnic
Data
2017-11-03
Repositori
http://hdl.handle.net/2117/111067 Obrir en finestra nova
URL
https://arxiv.org/pdf/1711.01951.pdf Obrir en finestra nova
Resum
A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination number of G , ¿ ( G ), is the minimum cardinality of a locating-dominating set. In this work we study relationships between ¿ ( G ) and ¿ ( G ) for bipartite graphs. The main result is the characterization of all connected bipartite graphs G satisfying ¿ ( G ) = ¿ ( G ) + ...
Paraules clau
Domination, Location, Distinguishing Set, Locating Domination, Complement Graph, Bipartite Graph
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta