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: | Yang, Feiran |
---|---|
Other Authors: | MacGillivray, Gary |
Language: | English en |
Published: |
2015
|
Subjects: | |
Online Access: | http://hdl.handle.net/1828/6627 |
Similar Items
-
Broadcasts and multipackings in graphs
by: Teshima, Laura Elizabeth
Published: (2012) -
A Note on Path Domination
by: Alcón Liliana
Published: (2016-11-01) -
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
by: Caria Pablo De, et al.
Published: (2014-08-01) -
Strongly Unichord-Free Graphs
by: McKee Terry A.
Published: (2019-05-01) -
STRENGTH DOMINATION IN FUZZY GRAPH
by: Iuliana Carmen Bărbăcioru, et al.
Published: (2019-11-01)