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. / Graduate
| Identifer | oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/4341 |
| Date | 10 December 2012 |
| Creators | Teshima, Laura Elizabeth |
| Contributors | Mynhardt, C. M., Brewster, R. C. |
| Source Sets | University of Victoria |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | Available to the World Wide Web |
Page generated in 0.002 seconds