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...
| Authors: | , , , , |
|---|---|
| Format: | article |
| Publication Date: | 2018 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/117013 |
| Online Access: | https://hdl.handle.net/2117/117013 https://dx.doi.org/10.2298/AADM1801205C |
| Access Level: | Open access |
| Keyword: | 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 |
| Summary: | 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. |
|---|