Tree patrolling conjecture for the E-patrolling strategy

Let $Q$ be a tree network, let $\alpha>0$ be the attack duration, let $E$ denote the set used to define the $E$-patrolling strategy, let $\mu$ denote the measure of $Q$, and let $v^*$ be the value of the continuous patrolling game on $Q$. Tree patrolling conjecture. For any $\alpha$, the $E$-patrolling strategy is optimal and

$$v^* = \frac{\alpha}{\mu+\lambda(E)}.$$

The $E$-patrolling strategy was previously known to be optimal for trees satisfying the Leaf Condition. The paper's abstract states that it proves this conjecture, so the conjecture is resolved by the source.