The article explores how branching random walks on graphs behave, focusing on their directions and boundaries. It shows that these walks can have different outcomes in subgraphs, like either surviving or persisting. Surprisingly, a random walk can reach the boundary of a disconnected subgraph even if the branching random walk doesn't survive there. The study reveals new connections between different types of boundaries and provides examples to illustrate these complex behaviors.