Suppose we have a zombie outbreak on a connected $k$-regular graph of order $n$. There are $n_0$ initially infected zombie nodes, and each turn, each zombie infects its neighbors with probability ...
Proof completion: Determine a simple expression for $\tau(G)$ in terms of the vertex degrees of $G$. (details inside)
I need some help completing a proof I wrote (or seeing a simpler solution to the same problem). For a list of paths $P_1, \ldots , P_m$, let $L(P_1, \ldots, P_m)$ be the number of paths in $P_1, ...