Return to search

Broadcast independence in graphs

The 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. / Graduate

Identiferoai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/11084
Date29 August 2019
CreatorsNeilson, Linda
ContributorsMynhardt, C. M.
Source SetsUniversity of Victoria
LanguageEnglish, English
Detected LanguageEnglish
TypeThesis
Formatapplication/pdf
RightsAvailable to the World Wide Web

Page generated in 0.0019 seconds