Back to search

University of Victoria (Canada)

Trees with equal broadcast and domination numbers

Abstract

dc:description.abstract

A broadcast on a graph G=(V,E) is a function f : V → {0, ..., diam(G)} that assigns an integer value to each vertex such that, for each v ∈ V , f (v) ≤ e(v), the eccentricity of v. The broadcast number of a graph is the minimum value of Σv∈V f (v) among all broadcasts f with the property that for each vertex x of V, f (v) ≥ d(x, v) for some vertex v having positive f (v). This number is bounded above by both the radius of the graph and its domination number. Graphs for which the broadcast number is equal to the domination number are called 1-cap graphs. We investigate and characterize a class of 1-cap trees.

Degree

thesis:*
Level thesis:degree_level
Master of Science M.Sc.
Department thesis:degree_department
Department of Mathematics and Statistics
Year dc:date.issued
2011

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lunney, Scott
Advisor dc:contributor.supervisor
  • Mynhardt, C. M.

Subjects

dc:subject × 2

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/3746

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

Lunney, Scott. Trees with equal broadcast and domination numbers. Master of Science M.Sc. thesis, 2011. http://hdl.handle.net/1828/3746