General bounds on limited broadcast domination
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/96711
Tipus de documentReport de recerca
Data publicació2016-09-19
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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 of caterpillars, providing a smaller upper bound, which is attained by a set of such graphs with unbounded order.
CitacióHernando, M., Mora, M., Pelayo, I. M., Luz Puertas, M., Cáceres, José. "General bounds on limited broadcast domination". 2016.
URL repositori externhttp://128.84.21.199/pdf/1609.05675v1.pdf
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1609.05675v1.pdf | 428,0Kb | Visualitza/Obre |