Neilson, Linda2019-08-292019-08-2920192019-08-29http://hdl.handle.net/1828/11084The usual graph parameters related to independent and dominating sets can be adapted to broadcasts on graphs. We examine some possible definitions for an inde- pendent broadcast. We determine the minimum maximal and the maximum broad- cast weight for all our independence parameters on both paths and grids. For graphs in general, we examine the relationships between these broadcast independence pa- rameters and the existing minimum and maximum minimal broadcast domination weight (or cost). We also determine upper and lower bounds for maximum boundary independent broadcasts and a new upper bound for hearing independent broadcasts.enAvailable to the World Wide WebBroadcastsGraphsIndependenceThesis