Watching systems in complete bipartite graphs
Document typeConference report
Rights accessRestricted access - publisher's policy
Many problems related to location and domination give raise to different parameters in graphs. The aim is to determine the location of some facility, object, item by placing watchers in some vertices of the graph. Watching systems were introduced by Auger et al.  as a generalization of identifying codes, by considering the possibility of placing one or more watchers in each vertex. In this paper we study watching systems in complete bipartite graphs.
CitationHernando, M.; Mora, M.; Pelayo, I. Watching systems in complete bipartite graphs. A: Jornadas de Matemática Discreta y Algorítmica. "VIII Jornadas de Matemática Discreta y Algorítmica, Almería, 11-13 de Julio 2012". Almería: 2012, p. 53-60.