Carregant...
Carregant...

Vés al contingut (premeu Retorn)

General bounds on limited broadcast domination

Autor
Hernando, M.; Mora, M.; Pelayo, I. M.; Luz Puertas, M.; Cáceres, José
Tipus d'activitat
Document cientificotècnic
Data
2016-09-19
Repositori
http://hdl.handle.net/2117/96711 Obrir en finestra nova
URL
http://128.84.21.199/pdf/1609.05675v1.pdf Obrir en finestra nova
Resum
Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating number. We present a uni ed upper bound on this parameter for any value of k in terms of both k and the order of the graph. For the speci c case of the 2-broadcast dominating number, we show that this bound is tight for graphs as large as desired. We also study the family o...
Citació
Hernando, M., Mora, M., Pelayo, I. M., Luz Puertas, M., Cáceres, José. "General bounds on limited broadcast domination". 2016.
Paraules clau
Broadcast, Domination, Graph
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta

Participants

Arxius