This study examines the minimum expected treatments to eliminate viruses in m*n and n^2 triangular grid graphs. Treating a node clears the virus at that node and its adjacent neighbors. We compare Treatment Method 1 and 2 based on whether non-infected nodes can be selected. After elimination, each adjacent infected node has a probability p of reinfecting the site. We derive general formulas and identify conditions where the expectation is infinite for p=0 and p=1. Finally, for 0 < p < 1, we establish an upper bound for the minimum expectation to ensure nodes remain non-reinfected.