Vés al contingut (premeu Retorn)

Locating domination in bipartite graphs and their complements

Hernando, M.; Mora, M.; Pelayo, I. M.
Tipus d'activitat
Document cientificotècnic
Repositori Obrir en finestra nova
URL Obrir en finestra nova
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 ) + ...
Hernando, M., Mora, M., Pelayo, I. M. "Locating domination in bipartite graphs and their complements". 2017.
Paraules clau
bipartite graph, complement graph, distinguishing set, domination, locating domination, location
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry