New bounds for the broadcast domination number of a graph
type: Item
instance of: scholarly article
title: New bounds for the broadcast domination number of a graph
zbMATH Open document ID: 1266.05109
author: Laura E. Teshima
author: Richard C. Brewster
author: Christina M. Mynhardt
published in: Central European Journal of Mathematics
publication date: 2013-06-14T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6176169
zbMATH Keywords: broadcast domination
zbMATH Keywords: broadcast number
zbMATH Keywords: irredundance
zbMATH Keywords: multipacking
MaRDI profile type: Publication
full work available at URL: s11533-013-0234-8
OpenAlex ID: W2087113704
cites work: Q4677956
cites work: Q3378248
cites work: Graph-theoretic parameters concerning domination, independence, and irredundance
cites work: Q3158579
cites work: Q4211755
cites work: Properties of Hereditary Hypergraphs and Middle Graphs
cites work: Broadcasts and domination in trees
cites work: A linear‐time algorithm for broadcast domination in a tree
cites work: Broadcasts in graphs
cites work: Q4821947
cites work: Q4368728
cites work: Optimal broadcast domination in polynomial time
cites work: Radial trees
cites work: Relations between packing and covering numbers of a tree
cites work: Q3070327
cites work: A decomposition approach for solving a broadcast domination network design problem
DOI: 10.2478/S11533-013-0234-8
description: scientific article; zbMATH DE number 6176169