Broadcast independence and packing in certain classes of trees

Richard C. Brewster, Kiara A. McDonald

Given a graph $G=(V,E)$ of diameter $d$, a broadcast is a function $f:V(G)\to \{0,1,\dots ,d\}$ where $f(v)$ is at most the eccentricity of $v$. A vertex $v$ is broadcasting i…