Back to search

University of Victoria (Canada)

Generalisations of irredundance in graphs

Abstract

dc:description.abstract

The well studied class of irredundant vertex sets of a graph has been previously shown to be a special case of (a) a “Private Neighbor Cube” of eight classes of vertex subsets and (b) a family of sixty four classes of “generalised irredundant sets.” The thesis makes various advances in the theory of irredundance. More specifically: (i) Nordhaus-Gaddum results for all the sixty-four classes of generalised irredundant sets are obtained. (ii) Sharp lower bounds involving order and maximum degree are attained for two specific classes in the Private Neighbor Cube. (iii) A new framework which includes both of the above generalisations and various concepts of domination, is proposed.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Finbow, Stephen
Advisors dc:contributor.supervisor
  • Cockayne, E.J.
  • MacGillivray, Gary

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

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

Finbow, Stephen. Generalisations of irredundance in graphs. Doctor of Philosophy Ph.D. thesis, 2017. http://hdl.handle.net/1828/7913