New results on broadcast domination and multipacking
Let G be a graph and f be a function that maps V to {0,1,2, ..., diam(G)}. Let V+ be the set of all vertices such that f(v) is positive. If for every vertex v not in V+ there exists a vertex w in V+ such that the distance between v and w is at most f(w), then f is called a dominating broadcast...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/6627 |