Broadcast independence in graphs

Simple item page
dc.contributor.authorNeilson, Linda
dc.contributor.supervisorMynhardt, C. M.
dc.date.accessioned2019-08-29T18:47:22Z
dc.date.available2019-08-29T18:47:22Z
dc.date.copyright2019en_US
dc.date.issued2019-08-29
dc.degree.departmentDepartment of Mathematics and Statisticsen_US
dc.degree.levelDoctor of Philosophy Ph.D.en_US
dc.description.abstractThe 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.en_US
dc.description.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/11084
dc.languageEnglisheng
dc.language.isoenen_US
dc.rightsAvailable to the World Wide Weben_US
dc.subjectBroadcastsen_US
dc.subjectGraphsen_US
dc.subjectIndependenceen_US
dc.titleBroadcast independence in graphsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Neilson_Linda_PhD_2019.pdf
Size:
984.01 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
Theses (Mathematics and Statistics)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.