One-vaccination conjecture for the Pentagon Graph

Let the Pentagon Graph be the infinite graph obtained from a pentagonal tiling of the plane, with vertices of degrees three and four. Consider the virus-containment process in which the outbreak starts from one infected vertex and one vaccination is placed at each time step. The one-vaccination conjecture for the Pentagon Graph. One vaccination per time step is not sufficient to control an outbreak on the Pentagon Graph. The claim extends the paper's investigation of containment protocols from regular infinite grids to this nonregular infinite graph; whether one vaccination per time step can ever contain an outbreak remains open in the supplied text.