Protection of Graphs. Generic results with emphasis on Cartesian and Lexicographic product of graphs
Suppose that one or more entities are stationed at some of the vertices of a graph G and that an entity at a vertex can deal with a problem at any vertex in its closed neighbourhood. Informally, we say that G is protected under a given placement of entities if there exists at least one entity availa...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2020 |
| País: | España |
| Institución: | Universitat Oberta de Catalunya (UOC) |
| Repositorio: | O2, repositorio institucional de la UOC |
| OAI Identifier: | oai:openaccess.uoc.edu:10609/122346 |
| Acceso en línea: | http://hdl.handle.net/10609/122346 |
| Access Level: | acceso abierto |
| Palabra clave: | graph lexicographic product of graphs protection of graphs weak roman domination secure domination cartesian product of graphs gráficos protección de gráficos dominación romana débil dominación segura producto lexicográfico de gráficos producto cartesiano de gráficos gràfics protecció de gràfics feble dominació romana dominació segura producte lexicogràfic de gràfics producte cartesià de gràfics Mathematics -- TFM Matemàtica -- TFM Matemática -- TFM |
| Sumario: | Suppose that one or more entities are stationed at some of the vertices of a graph G and that an entity at a vertex can deal with a problem at any vertex in its closed neighbourhood. Informally, we say that G is protected under a given placement of entities if there exists at least one entity available to handle a problem at any vertex. Cockayne et al. [Bulletin of the Institute of Combinatorics and its Applications 39 (2003) 87{100] proposed four properties of such functions under which the entire graph may be protected according to a certain strategy. In each case the parameter of interest will be the minimum weight of a function in the subclass (minimum number of entities used). In this work, we obtain closed formulae and tight bounds for two of these protection types: weak Roman domination number and secure domination number; focusing in lexicographic and Cartesian product graphs in terms of invariants of the factor graphs involved in the product. It is shown that the problem of computing the weak Roman domination number (Henning and Hedetniemi [Discrete Math. 266 (2003) 239-251]) and secure domination number (Boumediene Merouane and Chellali [Inform. Process. Lett. 115 (10) (2015) 786{790.]) is NP-Hard, even when restricted to bipartite or chordal graphs. This suggests nding the domination number for special classes of graphs or obtaining good bounds on this invariant. |
|---|