Back to search

University of Victoria (Canada)

Broadcast independence in graphs

Abstract

dc:description.abstract

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.

Degree

thesis:*
Level thesis:degree_level
Doctor of Philosophy Ph.D.
Department thesis:degree_department
Department of Mathematics and Statistics
Year dc:date.issued
2019

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Neilson, Linda
Advisor dc:contributor.supervisor
  • Mynhardt, C. M.

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • Available to the World Wide Web
Language dc:language.iso
en, English

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1828/11084

Chain of custody

source
Harvested from
University of Victoria (Canada)
Base URL
dspace.library.uvic.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Neilson, Linda. Broadcast independence in graphs. Doctor of Philosophy Ph.D. thesis, 2019. http://hdl.handle.net/1828/11084