Generalisations of irredundance in graphs
Date
2017-04-13
Authors
Finbow, Stephen
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Graph theory, Domination (Graph theory)