Show simple item record

dc.contributor.authorHernando Martín, María del Carmen
dc.contributor.authorMora Giné, Mercè
dc.contributor.authorPelayo Melero, Ignacio Manuel
dc.contributor.authorPuertas, Maria Luz
dc.contributor.authorCáceres, José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.identifier.citationHernando, M., Mora, M., Pelayo, I. M., Luz Puertas, M., Cáceres, José. "General bounds on limited broadcast domination". 2016.
dc.description.abstractLimited 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.
dc.format.extent19 p.
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshGraph theory
dc.titleGeneral bounds on limited broadcast domination
dc.typeExternal research report
dc.subject.lemacGrafs, Teoria de
dc.subject.lemacNombres, Teoria dels
dc.contributor.groupUniversitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.rights.accessOpen Access
local.citation.authorHernando, M.; Mora, M.; Pelayo, I. M.; Luz Puertas, M.; Cáceres, José

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain