Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the associated parameter, the dominating 2-broadcast number. We prove that computing...
| Autores: | ; ; ; ; |
|---|---|
| Tipo de documento: | Artículo |
| Fecha de publicación: | 2018 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Lenguaje: | Inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/117013 |
| Acceso en línea: | https://hdl.handle.net/2117/117013 https://dx.doi.org/10.2298/AADM1801205C |
| Nivel de acceso: | Acceso abierto |
| Palabra clave: | Graph, theory Broadcast domination NP-complete decision problem Grafs, Teoria de Classificació AMS::05 Combinatorics::05C Graph theory Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Sumario: | Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the associated parameter, the dominating 2-broadcast number. We prove that computing the dominating 2-broadcast number is a NP-complete problem, but can be achieved in linear time for trees. We also give an upper bound for this parameter, that is tight for graphs as large as desired. |
|---|