  We investigate the number of topological ends of the trace of branching
random walk (BRW) on a graph, giving a sufficient condition for the trace to
have infinitely many ends. We then describe some interesting examples of
non-symmetric BRWs with just one end.
