Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs

Autor
Hernando, M.; Mora, M.; Pelayo, I. M.; Cáceres, José; Puertas, M. Luz
Tipus d'activitat
Document cientificotècnic
Data
2017-10-16
Repositori
http://hdl.handle.net/2117/109101 Obrir en finestra nova
URL
https://arxiv.org/pdf/1710.05953.pdf Obrir en finestra nova
Resum
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
Citació
Hernando, M., Mora, M., Pelayo, I. M., Cáceres, José, Puertas, M. L. "Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs". 2017.
Paraules clau
Broadcast. Domination. Np-complete Decision Problem.
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry

Participants

Arxius