4 papers
Lower Bound and Exact Values for the Boundary Independence Broadcast Number of a Tree
C. M. Mynhardt, L. Neilson
A broadcast on a nontrivial connected graph G is a function f from V(G) to the set {0,1,...,diam(G)} such that f(v) is at most the eccentricity of v for all vertices v of G. The we…
A Sharp Upper Bound for the Boundary Independence Broadcast Number of a Tree
C. M. Mynhardt, L. Neilson
A broadcast on a nontrivial connected graph G with vertex set V is a function f from V to {0,1,...,diam(G)} such that f(v) is at most the eccentricity of v for all vertices v. The…
Comparing Upper Broadcast Domination and Boundary Independence Numbers of Graphs
C. M. Mynhardt, L. Neilson
A broadcast on a nontrivial connected graph G with vertex set V is a function f from V to {0,1,...,diam(G)} such that f(v) is at most the eccentricity of v for all v in V. The weig…
Boundary Independent Broadcasts in Graphs
Christina Mynhardt, Linda Neilson
A broadcast on a nontrivial connected graph G is a function f from the vertices of G to the non-negative integers such that f(v) does not exceed e(v) (the eccentricity of v) for ea…