Generalisations of graph broadcasts
Let G be a graph with vertex set V (G) and edge set E(G). A dominating set S of a graph G is a subset of V (G) such that each vertex in V (G) is either in S itself or adjacent to a vertex in S. Domination and its variants have been well studied [11]. One variation introduced by Erwin in [9], invo...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | English |
| Published: |
University of Cape Town
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/11427/22717 |