Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs
| dc.contributor.author | Cáceres, José |
| dc.contributor.author | Hernando Martín, María del Carmen |
| dc.contributor.author | Mora Giné, Mercè |
| dc.contributor.author | Pelayo Melero, Ignacio Manuel |
| dc.contributor.author | Puertas González, María Luz |
| dc.contributor.group | Universitat Politècnica de Catalunya. DCG - Discrete and Combinatorial Geometry |
| dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
| dc.date.accessioned | 2018-05-08T10:54:34Z |
| dc.date.available | 2018-05-08T10:54:34Z |
| dc.date.issued | 2018-04-20 |
| dc.description.abstract | 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. |
| dc.description.peerreviewed | Peer Reviewed |
| dc.description.version | Postprint (author's final draft) |
| dc.format.extent | 19 p. |
| dc.identifier.citation | Cáceres, José, Hernando, M., Mora, M., Pelayo, I. M., Puertas, M. L. Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs. "Applicable analysis and discrete mathematics", 20 Abril 2018, vol. 12, núm. 1, p. 205-223. |
| dc.identifier.doi | 10.2298/AADM1801205C |
| dc.identifier.issn | 1452-8630 |
| dc.identifier.uri | https://hdl.handle.net/2117/117013 |
| dc.language.iso | eng |
| dc.relation.projectid | info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT |
| dc.relation.publisherversion | http://pefmath.etf.rs/vol12num1/AADM-Vol12-No1-205-223.pdf |
| dc.rights.access | Open Access |
| dc.rights.licensename | Attribution-NonCommercial-NoDerivs 3.0 Spain |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
| dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
| dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
| dc.subject.lcsh | Graph, theory |
| dc.subject.lemac | Grafs, Teoria de |
| dc.subject.other | Broadcast |
| dc.subject.other | domination |
| dc.subject.other | NP-complete decision problem |
| dc.title | Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs |
| dc.type | Article |
| dspace.entity.type | Publication |
| local.citation.author | Cáceres, José; Hernando, M.; Mora, M.; Pelayo, I. M.; Puertas, M. Luz |
| local.citation.endingPage | 223 |
| local.citation.number | 1 |
| local.citation.publicationName | Applicable analysis and discrete mathematics |
| local.citation.startingPage | 205 |
| local.citation.volume | 12 |
| local.identifier.drac | 22425732 |
Fitxers
Paquet original
1 - 1 de 1