General bounds on limited broadcast domination
Tipus de documentArticle
Data publicació2018-10-26
EditorChapman & Hall/CRC
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
Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and classical domination. In this limited version, the broadcast function is upper bounded by an integer k and the minimum cost of such function is the dominating k-broadcast number. Our main result is a unified upper bound on this parameter for any value of k in general graphs, in terms of both k and the order of the graph. We also study the computational complexity of the associated decision problem
CitacióHernando, M., Mora, M., Pelayo, I. M., Cáceres, José, Puertas, M. L. General bounds on limited broadcast domination. "Discrete mathematics and theoretical computer science", 26 Octubre 2018, vol. 20, núm. 2, p. 1-18.
ISSN1462-7264
Altres identificadorshttps://arxiv.org/pdf/1609.05675.pdf
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1609.05675-1.pdf | 392,9Kb | Visualitza/Obre | ||
1609.05675-1.pdf | 392,9Kb | Visualitza/Obre |