Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

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...

Full description

Saved in:
Bibliographic Details
Main Author: Faul, Peter
Other Authors: Erwin, David
Format: Thesis
Language:English
Published: Department of Mathematics and Applied Mathematics 2017
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items: Generalisations of graph broadcasts