Broadcast independence in graphs
The usual graph parameters related to independent and dominating sets can be adapted to broadcasts on graphs. We examine some possible definitions for an inde- pendent broadcast. We determine the minimum maximal and the maximum broad- cast weight for all our independence parameters on both paths and...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/11084 |