Generalisations of irredundance in graphs
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 theor...
Main Author: | |
---|---|
Other Authors: | |
Language: | English en |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/1828/7913 |