Broadcasts and multipackings in graphs
| dc.contributor.author | Teshima, Laura Elizabeth | |
| dc.contributor.supervisor | Mynhardt, C. M. | |
| dc.contributor.supervisor | Brewster, R. C. | |
| dc.date.accessioned | 2012-12-10T23:04:52Z | |
| dc.date.available | 2012-12-10T23:04:52Z | |
| dc.date.copyright | 2012 | en_US |
| dc.date.issued | 2012-12-10 | |
| dc.degree.department | Dept. of Mathematics and Statistics | en_US |
| dc.degree.level | Master of Science M.Sc. | en_US |
| dc.description.abstract | A broadcast is a function f that assigns an integer value to each vertex of a graph such that, for each v ∈ V , f (v) ≤ e (v), where e(v) is the eccentricity of v. The broadcast number of a graph is the minimum value of ∑ f(v) among all broadcasts f with the property that for each vertex u ∈ V, there exists some v ∈ V with f(v) > 0 such that d(υ,v) ≤ f(v). We present a new upper bound for the broadcast number of a graph in terms of its irredundance number and a new dual property of the broadcast number called the multipacking number of a graph. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/4341 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights.temp | Available to the World Wide Web | en_US |
| dc.subject | Graph Theory | en_US |
| dc.subject | Broadcast Domination | en_US |
| dc.subject | Multipackings | en_US |
| dc.subject | Irredundance | en_US |
| dc.title | Broadcasts and multipackings in graphs | en_US |
| dc.type | Thesis | en_US |